./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:55:56,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:55:56,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 21:55:56,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:55:56,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:55:56,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:55:56,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:55:56,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:55:56,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:55:56,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:55:56,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:55:56,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:55:56,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:55:56,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:55:56,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:55:56,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:55:56,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:55:56,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 21:55:56,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:55:56,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 21:55:56,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:55:56,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:55:56,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:55:56,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:55:56,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:55:56,466 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:55:56,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:55:56,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 21:55:56,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:55:56,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:55:56,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:55:56,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:55:56,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:55:56,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:55:56,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:55:56,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:55:56,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:55:56,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:55:56,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:55:56,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:55:56,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:55:56,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:55:56,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:55:56,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:55:56,474 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 [2024-11-10 21:55:56,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:55:56,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:55:56,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:55:56,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:55:56,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:55:56,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-10 21:55:58,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:55:58,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:55:58,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-10 21:55:58,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fe2958e/a0fb4f3737c04f4db763bdea2a525edd/FLAG25f525d7c [2024-11-10 21:55:58,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3fe2958e/a0fb4f3737c04f4db763bdea2a525edd [2024-11-10 21:55:58,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:55:58,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:55:58,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:55:58,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:55:58,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:55:58,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:58" (1/1) ... [2024-11-10 21:55:58,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f366bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:58, skipping insertion in model container [2024-11-10 21:55:58,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:55:58" (1/1) ... [2024-11-10 21:55:58,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:55:59,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:55:59,461 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:55:59,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:55:59,683 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:55:59,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59 WrapperNode [2024-11-10 21:55:59,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:55:59,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:55:59,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:55:59,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:55:59,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,804 INFO L138 Inliner]: procedures = 176, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 992 [2024-11-10 21:55:59,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:55:59,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:55:59,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:55:59,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:55:59,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,940 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-10 21:55:59,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:55:59,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:56:00,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:56:00,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:56:00,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:56:00,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:56:00,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:56:00,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (1/1) ... [2024-11-10 21:56:00,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:56:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:00,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 21:56:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 21:56:00,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:56:00,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:56:00,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 21:56:00,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 21:56:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:56:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:56:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 21:56:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 21:56:00,105 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 21:56:00,107 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 21:56:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:56:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:56:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:56:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:56:00,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:56:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:56:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:56:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:56:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:56:00,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:56:00,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:56:00,317 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:56:00,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:56:01,482 INFO L? ?]: Removed 238 outVars from TransFormulas that were not future-live. [2024-11-10 21:56:01,482 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:56:01,540 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:56:01,540 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 21:56:01,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:01 BoogieIcfgContainer [2024-11-10 21:56:01,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:56:01,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:56:01,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:56:01,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:56:01,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:55:58" (1/3) ... [2024-11-10 21:56:01,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5b30cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:56:01, skipping insertion in model container [2024-11-10 21:56:01,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:55:59" (2/3) ... [2024-11-10 21:56:01,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5b30cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:56:01, skipping insertion in model container [2024-11-10 21:56:01,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:01" (3/3) ... [2024-11-10 21:56:01,550 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-2.i [2024-11-10 21:56:01,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:56:01,568 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 21:56:01,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:56:01,654 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;@4349af97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:56:01,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 21:56:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 282 states have internal predecessors, (428), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:56:01,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:01,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:01,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:01,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1150794998, now seen corresponding path program 1 times [2024-11-10 21:56:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:01,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946142798] [2024-11-10 21:56:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:56:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:01,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946142798] [2024-11-10 21:56:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946142798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:01,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:01,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 21:56:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525980897] [2024-11-10 21:56:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:01,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:56:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:01,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:56:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:56:01,843 INFO L87 Difference]: Start difference. First operand has 288 states, 266 states have (on average 1.6090225563909775) internal successors, (428), 282 states have internal predecessors, (428), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:01,933 INFO L93 Difference]: Finished difference Result 572 states and 915 transitions. [2024-11-10 21:56:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:56:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 21:56:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:01,950 INFO L225 Difference]: With dead ends: 572 [2024-11-10 21:56:01,950 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 21:56:01,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:56:01,962 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:01,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 21:56:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 21:56:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-10 21:56:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 226 states have (on average 1.4469026548672566) internal successors, (327), 240 states have internal predecessors, (327), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 353 transitions. [2024-11-10 21:56:02,018 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 353 transitions. Word has length 7 [2024-11-10 21:56:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 353 transitions. [2024-11-10 21:56:02,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 353 transitions. [2024-11-10 21:56:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:56:02,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:02,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:02,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:56:02,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:02,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1018395529, now seen corresponding path program 1 times [2024-11-10 21:56:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:02,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544217463] [2024-11-10 21:56:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:56:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544217463] [2024-11-10 21:56:02,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544217463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:02,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:02,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764791906] [2024-11-10 21:56:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:02,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:02,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:02,117 INFO L87 Difference]: Start difference. First operand 246 states and 353 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:02,286 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2024-11-10 21:56:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:02,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 21:56:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:02,291 INFO L225 Difference]: With dead ends: 481 [2024-11-10 21:56:02,291 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 21:56:02,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:02,293 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 279 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:02,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 646 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 21:56:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 252. [2024-11-10 21:56:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 232 states have (on average 1.4353448275862069) internal successors, (333), 246 states have internal predecessors, (333), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 359 transitions. [2024-11-10 21:56:02,319 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 359 transitions. Word has length 8 [2024-11-10 21:56:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:02,320 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 359 transitions. [2024-11-10 21:56:02,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 359 transitions. [2024-11-10 21:56:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:56:02,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:02,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:02,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:56:02,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:02,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash -512155375, now seen corresponding path program 1 times [2024-11-10 21:56:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327067777] [2024-11-10 21:56:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:56:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:02,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327067777] [2024-11-10 21:56:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327067777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:02,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:02,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186913076] [2024-11-10 21:56:02,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:02,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:02,742 INFO L87 Difference]: Start difference. First operand 252 states and 359 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:02,893 INFO L93 Difference]: Finished difference Result 516 states and 740 transitions. [2024-11-10 21:56:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 21:56:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:02,896 INFO L225 Difference]: With dead ends: 516 [2024-11-10 21:56:02,897 INFO L226 Difference]: Without dead ends: 272 [2024-11-10 21:56:02,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:02,900 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 8 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:02,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 607 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-10 21:56:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-10 21:56:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 252 states have (on average 1.4007936507936507) internal successors, (353), 266 states have internal predecessors, (353), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 379 transitions. [2024-11-10 21:56:02,929 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 379 transitions. Word has length 83 [2024-11-10 21:56:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:02,929 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 379 transitions. [2024-11-10 21:56:02,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 379 transitions. [2024-11-10 21:56:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:56:02,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:02,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:02,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:56:02,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:02,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1418463730, now seen corresponding path program 1 times [2024-11-10 21:56:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508240449] [2024-11-10 21:56:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:56:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508240449] [2024-11-10 21:56:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508240449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406502611] [2024-11-10 21:56:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:03,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:56:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:03,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:56:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:56:03,217 INFO L87 Difference]: Start difference. First operand 272 states and 379 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:03,356 INFO L93 Difference]: Finished difference Result 522 states and 736 transitions. [2024-11-10 21:56:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:56:03,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2024-11-10 21:56:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:03,359 INFO L225 Difference]: With dead ends: 522 [2024-11-10 21:56:03,359 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 21:56:03,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:03,363 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 105 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:03,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 824 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:03,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 21:56:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-10 21:56:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 238 states have (on average 1.3949579831932772) internal successors, (332), 252 states have internal predecessors, (332), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2024-11-10 21:56:03,389 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 83 [2024-11-10 21:56:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:03,389 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2024-11-10 21:56:03,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2024-11-10 21:56:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 21:56:03,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:03,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:03,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:56:03,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:03,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash 32520011, now seen corresponding path program 1 times [2024-11-10 21:56:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370766054] [2024-11-10 21:56:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:56:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:03,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370766054] [2024-11-10 21:56:03,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370766054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:03,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:03,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:56:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099872488] [2024-11-10 21:56:03,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:03,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:56:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:03,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:56:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:03,578 INFO L87 Difference]: Start difference. First operand 258 states and 358 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:03,698 INFO L93 Difference]: Finished difference Result 643 states and 903 transitions. [2024-11-10 21:56:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:56:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2024-11-10 21:56:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:03,702 INFO L225 Difference]: With dead ends: 643 [2024-11-10 21:56:03,702 INFO L226 Difference]: Without dead ends: 393 [2024-11-10 21:56:03,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:56:03,704 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 134 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:03,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 638 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:56:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-10 21:56:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-10 21:56:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 373 states have (on average 1.4101876675603218) internal successors, (526), 387 states have internal predecessors, (526), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 21:56:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 552 transitions. [2024-11-10 21:56:03,720 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 552 transitions. Word has length 83 [2024-11-10 21:56:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:03,721 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 552 transitions. [2024-11-10 21:56:03,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:56:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 552 transitions. [2024-11-10 21:56:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 21:56:03,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:03,723 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:03,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 21:56:03,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1461205576, now seen corresponding path program 1 times [2024-11-10 21:56:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:03,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330535398] [2024-11-10 21:56:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:03,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330535398] [2024-11-10 21:56:04,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330535398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:04,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:56:04,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:56:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947528343] [2024-11-10 21:56:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:56:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:56:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:04,008 INFO L87 Difference]: Start difference. First operand 393 states and 552 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:04,393 INFO L93 Difference]: Finished difference Result 464 states and 649 transitions. [2024-11-10 21:56:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:56:04,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 98 [2024-11-10 21:56:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:04,397 INFO L225 Difference]: With dead ends: 464 [2024-11-10 21:56:04,400 INFO L226 Difference]: Without dead ends: 462 [2024-11-10 21:56:04,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:56:04,401 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 194 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:04,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1151 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:56:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-10 21:56:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2024-11-10 21:56:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 435 states have (on average 1.3908045977011494) internal successors, (605), 449 states have internal predecessors, (605), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:56:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 637 transitions. [2024-11-10 21:56:04,428 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 637 transitions. Word has length 98 [2024-11-10 21:56:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:04,430 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 637 transitions. [2024-11-10 21:56:04,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 637 transitions. [2024-11-10 21:56:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 21:56:04,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:04,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:56:04,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 21:56:04,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1577490515, now seen corresponding path program 1 times [2024-11-10 21:56:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:04,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16832393] [2024-11-10 21:56:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:04,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16832393] [2024-11-10 21:56:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16832393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886754685] [2024-11-10 21:56:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:04,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:56:04,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 21:56:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:04,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:56:04,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:05,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:56:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886754685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:56:05,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:56:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 21:56:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800249305] [2024-11-10 21:56:05,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:56:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:56:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:56:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:56:05,387 INFO L87 Difference]: Start difference. First operand 458 states and 637 transitions. Second operand has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:56:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:05,892 INFO L93 Difference]: Finished difference Result 708 states and 999 transitions. [2024-11-10 21:56:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:56:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 106 [2024-11-10 21:56:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:05,896 INFO L225 Difference]: With dead ends: 708 [2024-11-10 21:56:05,896 INFO L226 Difference]: Without dead ends: 673 [2024-11-10 21:56:05,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:56:05,900 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1297 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:05,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1734 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:56:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-10 21:56:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 670. [2024-11-10 21:56:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 644 states have (on average 1.3866459627329193) internal successors, (893), 658 states have internal predecessors, (893), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 21:56:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 931 transitions. [2024-11-10 21:56:05,923 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 931 transitions. Word has length 106 [2024-11-10 21:56:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:05,924 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 931 transitions. [2024-11-10 21:56:05,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 10 states have internal predecessors, (280), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 21:56:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 931 transitions. [2024-11-10 21:56:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 21:56:05,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:05,926 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1] [2024-11-10 21:56:05,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 21:56:06,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:06,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1564869102, now seen corresponding path program 1 times [2024-11-10 21:56:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047213294] [2024-11-10 21:56:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:56:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:56:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:56:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047213294] [2024-11-10 21:56:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047213294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832668129] [2024-11-10 21:56:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:06,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:06,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:06,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:56:06,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 21:56:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:06,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 21:56:06,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:06,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 21:56:06,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 21:56:07,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 21:56:07,550 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-10 21:56:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:56:08,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:56:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832668129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:56:08,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:56:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-10 21:56:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7471197] [2024-11-10 21:56:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:56:08,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:56:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:56:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:56:08,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-10 21:56:08,166 INFO L87 Difference]: Start difference. First operand 670 states and 931 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:56:09,781 INFO L93 Difference]: Finished difference Result 1282 states and 1777 transitions. [2024-11-10 21:56:09,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 21:56:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 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 106 [2024-11-10 21:56:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:56:09,785 INFO L225 Difference]: With dead ends: 1282 [2024-11-10 21:56:09,785 INFO L226 Difference]: Without dead ends: 708 [2024-11-10 21:56:09,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-10 21:56:09,787 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 547 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:56:09,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1609 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 21:56:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-10 21:56:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 703. [2024-11-10 21:56:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 677 states have (on average 1.3751846381093058) internal successors, (931), 691 states have internal predecessors, (931), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 21:56:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 969 transitions. [2024-11-10 21:56:09,808 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 969 transitions. Word has length 106 [2024-11-10 21:56:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:56:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 969 transitions. [2024-11-10 21:56:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:56:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 969 transitions. [2024-11-10 21:56:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 21:56:09,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:56:09,811 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1] [2024-11-10 21:56:09,830 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-10 21:56:10,013 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-10 21:56:10,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:56:10,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:56:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1991507609, now seen corresponding path program 1 times [2024-11-10 21:56:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:56:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503650492] [2024-11-10 21:56:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:56:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 21:56:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 21:56:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 21:56:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:56:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503650492] [2024-11-10 21:56:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503650492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:56:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860873852] [2024-11-10 21:56:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:56:10,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:56:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:56:10,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:56:10,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 21:56:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:56:10,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 21:56:10,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:56:48,239 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 21:57:25,165 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 30 DAG size of output: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)