./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.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 e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:22:01,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:22:01,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:22:01,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:22:01,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:22:01,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:22:01,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:22:01,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:22:01,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:22:01,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:22:01,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:22:01,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:22:01,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:22:01,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:22:01,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:22:01,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:22:01,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:22:01,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:22:01,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:22:01,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:22:01,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:22:01,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:22:01,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:22:01,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:22:01,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:22:01,241 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:22:01,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:22:01,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:22:01,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:22:01,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:22:01,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:22:01,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:22:01,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:22:01,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:22:01,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:22:01,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:22:01,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:22:01,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:22:01,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:22:01,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:22:01,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:22:01,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:22:01,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:22:01,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:22:01,247 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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2024-11-12 20:22:01,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:22:01,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:22:01,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:22:01,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:22:01,551 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:22:01,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2024-11-12 20:22:03,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:22:03,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:22:03,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2024-11-12 20:22:03,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd3a59a88/ac02fa6ad125484cae910cabe0d9d96e/FLAGaf93b1331 [2024-11-12 20:22:03,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd3a59a88/ac02fa6ad125484cae910cabe0d9d96e [2024-11-12 20:22:03,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:22:03,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:22:03,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:22:03,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:22:03,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:22:03,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:22:03" (1/1) ... [2024-11-12 20:22:03,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369cfdbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:03, skipping insertion in model container [2024-11-12 20:22:03,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:22:03" (1/1) ... [2024-11-12 20:22:03,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:22:04,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:22:04,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:22:04,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:22:04,533 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:22:04,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04 WrapperNode [2024-11-12 20:22:04,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:22:04,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:22:04,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:22:04,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:22:04,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,698 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3290 [2024-11-12 20:22:04,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:22:04,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:22:04,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:22:04,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:22:04,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,803 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [172, 2, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [42, 0, 4]. [2024-11-12 20:22:04,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:22:04,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:22:04,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:22:04,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:22:04,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (1/1) ... [2024-11-12 20:22:04,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:22:04,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:22:04,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 20:22:04,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 20:22:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 20:22:04,989 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 20:22:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:22:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:22:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:22:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:22:04,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:22:04,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:22:04,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:22:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:22:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:22:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:22:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 20:22:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:22:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:22:04,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 20:22:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:22:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:22:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:22:04,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:22:05,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:22:05,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:22:07,943 INFO L? ?]: Removed 808 outVars from TransFormulas that were not future-live. [2024-11-12 20:22:07,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:22:07,983 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:22:07,984 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-12 20:22:07,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:22:07 BoogieIcfgContainer [2024-11-12 20:22:07,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:22:07,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:22:07,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:22:07,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:22:07,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:22:03" (1/3) ... [2024-11-12 20:22:07,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f515e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:22:07, skipping insertion in model container [2024-11-12 20:22:07,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:04" (2/3) ... [2024-11-12 20:22:07,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f515e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:22:07, skipping insertion in model container [2024-11-12 20:22:07,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:22:07" (3/3) ... [2024-11-12 20:22:07,994 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2024-11-12 20:22:08,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:22:08,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 20:22:08,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:22:08,125 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;@4ff34e22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:22:08,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 20:22:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 1388 states, 871 states have (on average 1.8392652123995408) internal successors, (1602), 1381 states have internal predecessors, (1602), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-12 20:22:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:22:08,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:08,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:08,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-12 20:22:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484802520] [2024-11-12 20:22:08,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:22:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484802520] [2024-11-12 20:22:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484802520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:22:08,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223144046] [2024-11-12 20:22:08,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:08,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:22:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:22:08,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:22:08,382 INFO L87 Difference]: Start difference. First operand has 1388 states, 871 states have (on average 1.8392652123995408) internal successors, (1602), 1381 states have internal predecessors, (1602), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:08,630 INFO L93 Difference]: Finished difference Result 2772 states and 5721 transitions. [2024-11-12 20:22:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:22:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 20:22:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:08,675 INFO L225 Difference]: With dead ends: 2772 [2024-11-12 20:22:08,676 INFO L226 Difference]: Without dead ends: 1379 [2024-11-12 20:22:08,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:22:08,693 INFO L435 NwaCegarLoop]: 2549 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, 2549 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:08,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:22:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-12 20:22:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2024-11-12 20:22:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 866 states have (on average 1.7725173210161662) internal successors, (1535), 1373 states have internal predecessors, (1535), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:22:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2541 transitions. [2024-11-12 20:22:09,077 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2541 transitions. Word has length 7 [2024-11-12 20:22:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:09,077 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2541 transitions. [2024-11-12 20:22:09,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2541 transitions. [2024-11-12 20:22:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:22:09,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:09,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:09,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:22:09,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-12 20:22:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268422295] [2024-11-12 20:22:09,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:22:09,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813979593] [2024-11-12 20:22:09,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:22:09,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:22:09,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:22:09,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:22:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:09,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:22:09,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:22:09,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:22:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:22:09,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:22:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268422295] [2024-11-12 20:22:09,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:22:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813979593] [2024-11-12 20:22:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813979593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:09,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:22:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977007170] [2024-11-12 20:22:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:09,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:22:09,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:09,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:22:09,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:22:09,425 INFO L87 Difference]: Start difference. First operand 1379 states and 2541 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:10,376 INFO L93 Difference]: Finished difference Result 2748 states and 5073 transitions. [2024-11-12 20:22:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:22:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 20:22:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:10,401 INFO L225 Difference]: With dead ends: 2748 [2024-11-12 20:22:10,401 INFO L226 Difference]: Without dead ends: 2746 [2024-11-12 20:22:10,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:22:10,405 INFO L435 NwaCegarLoop]: 2794 mSDtfsCounter, 1519 mSDsluCounter, 4807 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 7601 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:10,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 7601 Invalid, 575 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:22:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2024-11-12 20:22:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1385. [2024-11-12 20:22:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.768348623853211) internal successors, (1542), 1379 states have internal predecessors, (1542), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:22:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2548 transitions. [2024-11-12 20:22:10,707 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2548 transitions. Word has length 7 [2024-11-12 20:22:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:10,708 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2548 transitions. [2024-11-12 20:22:10,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2548 transitions. [2024-11-12 20:22:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 20:22:10,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:10,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:10,735 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-12 20:22:10,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:22:10,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-12 20:22:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219009561] [2024-11-12 20:22:10,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:22:11,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219009561] [2024-11-12 20:22:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219009561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:11,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:11,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:22:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531820519] [2024-11-12 20:22:11,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:22:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:22:11,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:22:11,341 INFO L87 Difference]: Start difference. First operand 1385 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:12,138 INFO L93 Difference]: Finished difference Result 3915 states and 7314 transitions. [2024-11-12 20:22:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:22:12,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-12 20:22:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:12,160 INFO L225 Difference]: With dead ends: 3915 [2024-11-12 20:22:12,160 INFO L226 Difference]: Without dead ends: 2745 [2024-11-12 20:22:12,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:22:12,169 INFO L435 NwaCegarLoop]: 2767 mSDtfsCounter, 1520 mSDsluCounter, 4781 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 7548 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:12,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 7548 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 20:22:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2024-11-12 20:22:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1385. [2024-11-12 20:22:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.7672018348623852) internal successors, (1541), 1379 states have internal predecessors, (1541), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-12 20:22:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2547 transitions. [2024-11-12 20:22:12,484 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2547 transitions. Word has length 64 [2024-11-12 20:22:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2547 transitions. [2024-11-12 20:22:12,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2547 transitions. [2024-11-12 20:22:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:22:12,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:12,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:22:12,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-12 20:22:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152814659] [2024-11-12 20:22:12,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:22:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152814659] [2024-11-12 20:22:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152814659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:12,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:22:12,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172745945] [2024-11-12 20:22:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:12,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:22:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:22:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:22:12,749 INFO L87 Difference]: Start difference. First operand 1385 states and 2547 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:12,880 INFO L93 Difference]: Finished difference Result 2765 states and 5089 transitions. [2024-11-12 20:22:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:22:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-12 20:22:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:12,892 INFO L225 Difference]: With dead ends: 2765 [2024-11-12 20:22:12,892 INFO L226 Difference]: Without dead ends: 1388 [2024-11-12 20:22:12,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:22:12,901 INFO L435 NwaCegarLoop]: 2513 mSDtfsCounter, 87 mSDsluCounter, 7434 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 20:22:12,901 INFO L436 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-12 20:22:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-12 20:22:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-12 20:22:13,099 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-12 20:22:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2540 transitions. [2024-11-12 20:22:13,110 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2540 transitions. Word has length 81 [2024-11-12 20:22:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:13,110 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2540 transitions. [2024-11-12 20:22:13,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2540 transitions. [2024-11-12 20:22:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:22:13,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:13,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:13,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:22:13,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:13,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash 774993816, now seen corresponding path program 1 times [2024-11-12 20:22:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464619860] [2024-11-12 20:22:13,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:22:13,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:13,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464619860] [2024-11-12 20:22:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464619860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:13,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:13,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:22:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168832937] [2024-11-12 20:22:13,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:13,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:22:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:13,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:22:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:22:13,281 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-12 20:22:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:13,444 INFO L93 Difference]: Finished difference Result 4033 states and 7470 transitions. [2024-11-12 20:22:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:22:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-12 20:22:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:13,465 INFO L225 Difference]: With dead ends: 4033 [2024-11-12 20:22:13,466 INFO L226 Difference]: Without dead ends: 2656 [2024-11-12 20:22:13,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:22:13,474 INFO L435 NwaCegarLoop]: 2988 mSDtfsCounter, 1343 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 5508 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:13,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 5508 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:22:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2024-11-12 20:22:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2652. [2024-11-12 20:22:13,781 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-12 20:22:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4936 transitions. [2024-11-12 20:22:13,798 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 4936 transitions. Word has length 81 [2024-11-12 20:22:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:13,800 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 4936 transitions. [2024-11-12 20:22:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:22:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 4936 transitions. [2024-11-12 20:22:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:22:13,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:13,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:22:13,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1977382659, now seen corresponding path program 1 times [2024-11-12 20:22:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821777143] [2024-11-12 20:22:13,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:22:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:22:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:22:13,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821777143] [2024-11-12 20:22:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821777143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:13,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:22:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547121593] [2024-11-12 20:22:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:13,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:22:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:22:13,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:22:13,968 INFO L87 Difference]: Start difference. First operand 2652 states and 4936 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:16,190 INFO L93 Difference]: Finished difference Result 5241 states and 9788 transitions. [2024-11-12 20:22:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:22:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-12 20:22:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:16,210 INFO L225 Difference]: With dead ends: 5241 [2024-11-12 20:22:16,211 INFO L226 Difference]: Without dead ends: 2667 [2024-11-12 20:22:16,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:22:16,221 INFO L435 NwaCegarLoop]: 2524 mSDtfsCounter, 7 mSDsluCounter, 3473 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5997 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:16,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5997 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 20:22:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2024-11-12 20:22:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2664. [2024-11-12 20:22:16,498 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-12 20:22:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4948 transitions. [2024-11-12 20:22:16,514 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4948 transitions. Word has length 96 [2024-11-12 20:22:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:16,515 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 4948 transitions. [2024-11-12 20:22:16,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4948 transitions. [2024-11-12 20:22:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:22:16,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:16,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:16,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:22:16,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:16,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -291202821, now seen corresponding path program 1 times [2024-11-12 20:22:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019442060] [2024-11-12 20:22:16,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:22:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:16,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:22:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:22:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019442060] [2024-11-12 20:22:16,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019442060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:16,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:22:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714019144] [2024-11-12 20:22:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:16,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:22:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:22:16,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:22:16,903 INFO L87 Difference]: Start difference. First operand 2664 states and 4948 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:21,072 INFO L93 Difference]: Finished difference Result 4909 states and 9298 transitions. [2024-11-12 20:22:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:22:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-12 20:22:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:21,117 INFO L225 Difference]: With dead ends: 4909 [2024-11-12 20:22:21,117 INFO L226 Difference]: Without dead ends: 4907 [2024-11-12 20:22:21,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:22:21,120 INFO L435 NwaCegarLoop]: 2774 mSDtfsCounter, 1433 mSDsluCounter, 4965 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 1006 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1935 SdHoareTripleChecker+Valid, 7739 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:21,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1935 Valid, 7739 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1006 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-12 20:22:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4907 states. [2024-11-12 20:22:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4907 to 2728. [2024-11-12 20:22:21,655 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-12 20:22:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 5032 transitions. [2024-11-12 20:22:21,672 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 5032 transitions. Word has length 96 [2024-11-12 20:22:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:21,673 INFO L471 AbstractCegarLoop]: Abstraction has 2728 states and 5032 transitions. [2024-11-12 20:22:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 5032 transitions. [2024-11-12 20:22:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 20:22:21,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:21,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:21,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:22:21,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1615527130, now seen corresponding path program 1 times [2024-11-12 20:22:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:21,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168321167] [2024-11-12 20:22:21,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:21,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:22:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:22,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:22:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:22:22,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168321167] [2024-11-12 20:22:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168321167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:22:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157699656] [2024-11-12 20:22:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:22,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:22:22,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:22:22,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:22:22,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:22:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:22,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 20:22:22,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:22:22,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:22:22,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-12 20:22:22,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 20:22:23,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 20:22:23,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-11-12 20:22:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:22:23,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:22:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157699656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:23,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:22:23,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-12 20:22:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908209369] [2024-11-12 20:22:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:22:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:22:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:22:23,262 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-12 20:22:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:26,541 INFO L93 Difference]: Finished difference Result 7577 states and 14237 transitions. [2024-11-12 20:22:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:22:26,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-12 20:22:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:26,592 INFO L225 Difference]: With dead ends: 7577 [2024-11-12 20:22:26,592 INFO L226 Difference]: Without dead ends: 4943 [2024-11-12 20:22:26,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-12 20:22:26,606 INFO L435 NwaCegarLoop]: 2766 mSDtfsCounter, 1791 mSDsluCounter, 20352 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 23118 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:26,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 23118 Invalid, 1861 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 20:22:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2024-11-12 20:22:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 2760. [2024-11-12 20:22:27,126 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-12 20:22:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 5069 transitions. [2024-11-12 20:22:27,145 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 5069 transitions. Word has length 102 [2024-11-12 20:22:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:27,145 INFO L471 AbstractCegarLoop]: Abstraction has 2760 states and 5069 transitions. [2024-11-12 20:22:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 5069 transitions. [2024-11-12 20:22:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 20:22:27,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:27,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:27,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:22:27,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-12 20:22:27,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1438589022, now seen corresponding path program 1 times [2024-11-12 20:22:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205447056] [2024-11-12 20:22:27,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:22:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:22:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:22:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205447056] [2024-11-12 20:22:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205447056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:22:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:22:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:22:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832134483] [2024-11-12 20:22:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:22:27,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:22:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:22:27,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:22:27,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:22:27,509 INFO L87 Difference]: Start difference. First operand 2760 states and 5069 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:22:29,878 INFO L93 Difference]: Finished difference Result 5353 states and 9909 transitions. [2024-11-12 20:22:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:22:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-12 20:22:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:22:29,895 INFO L225 Difference]: With dead ends: 5353 [2024-11-12 20:22:29,895 INFO L226 Difference]: Without dead ends: 2623 [2024-11-12 20:22:29,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:22:29,904 INFO L435 NwaCegarLoop]: 2434 mSDtfsCounter, 15 mSDsluCounter, 5232 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7666 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:22:29,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7666 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 20:22:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-12 20:22:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2620. [2024-11-12 20:22:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2620 states, 1604 states have (on average 1.7749376558603491) internal successors, (2847), 2611 states have internal predecessors, (2847), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2024-11-12 20:22:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 4859 transitions. [2024-11-12 20:22:30,223 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 4859 transitions. Word has length 102 [2024-11-12 20:22:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:22:30,224 INFO L471 AbstractCegarLoop]: Abstraction has 2620 states and 4859 transitions. [2024-11-12 20:22:30,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:22:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 4859 transitions. [2024-11-12 20:22:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 20:22:30,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:22:30,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:22:30,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 20:22:30,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:22:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:22:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash 85858995, now seen corresponding path program 1 times [2024-11-12 20:22:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:22:30,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215443668] [2024-11-12 20:22:30,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:30,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:22:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:22:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:30,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:22:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:22:30,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:22:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215443668] [2024-11-12 20:22:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215443668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:22:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813958389] [2024-11-12 20:22:30,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:22:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:22:30,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:22:30,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:22:30,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:22:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:22:30,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 20:22:30,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:23:04,863 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 20:23:24,435 WARN L286 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)