./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:43:05,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:43:05,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 23:43:05,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:43:05,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:43:05,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:43:05,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:43:05,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:43:05,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:43:05,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:43:05,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:43:05,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:43:05,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:43:05,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:43:05,705 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:43:05,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:43:05,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:43:05,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 23:43:05,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:43:05,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 23:43:05,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:43:05,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:43:05,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:43:05,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:43:05,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:43:05,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:43:05,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:43:05,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 23:43:05,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:43:05,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:43:05,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:43:05,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:43:05,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:43:05,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:43:05,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:43:05,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:43:05,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:43:05,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:43:05,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:43:05,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:43:05,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:43:05,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:43:05,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:43:05,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:43:05,713 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-clean/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-clean/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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2024-10-11 23:43:05,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:43:05,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:43:05,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:43:05,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:43:05,917 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:43:05,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-10-11 23:43:07,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:43:07,360 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:43:07,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-10-11 23:43:07,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b29e0e76c/e18a9fbd2c5f47eca89913403d4de6d7/FLAGf9de990af [2024-10-11 23:43:07,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b29e0e76c/e18a9fbd2c5f47eca89913403d4de6d7 [2024-10-11 23:43:07,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:43:07,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:43:07,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:43:07,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:43:07,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:43:07,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:07,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdc7c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07, skipping insertion in model container [2024-10-11 23:43:07,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:07,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:43:07,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:43:07,882 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:43:07,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:43:07,993 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:43:07,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07 WrapperNode [2024-10-11 23:43:07,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:43:07,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:43:07,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:43:07,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:43:08,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,078 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1597 [2024-10-11 23:43:08,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:43:08,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:43:08,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:43:08,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:43:08,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,155 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-11 23:43:08,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:43:08,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:43:08,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:43:08,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:43:08,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (1/1) ... [2024-10-11 23:43:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:43:08,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:43:08,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:43:08,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:43:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 23:43:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 23:43:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 23:43:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 23:43:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 23:43:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 23:43:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 23:43:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 23:43:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 23:43:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 23:43:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 23:43:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 23:43:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:43:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:43:08,480 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:43:08,482 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:43:09,765 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-10-11 23:43:09,765 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:43:09,807 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:43:09,807 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-11 23:43:09,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:43:09 BoogieIcfgContainer [2024-10-11 23:43:09,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:43:09,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:43:09,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:43:09,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:43:09,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:43:07" (1/3) ... [2024-10-11 23:43:09,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8f866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:43:09, skipping insertion in model container [2024-10-11 23:43:09,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:43:07" (2/3) ... [2024-10-11 23:43:09,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8f866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:43:09, skipping insertion in model container [2024-10-11 23:43:09,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:43:09" (3/3) ... [2024-10-11 23:43:09,815 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2024-10-11 23:43:09,827 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:43:09,827 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 23:43:09,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:43:09,890 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;@6f6652fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:43:09,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 23:43:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 406 states have (on average 1.6305418719211822) internal successors, (662), 422 states have internal predecessors, (662), 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-10-11 23:43:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 23:43:09,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:09,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 23:43:09,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:09,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1577960958, now seen corresponding path program 1 times [2024-10-11 23:43:09,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:09,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948576245] [2024-10-11 23:43:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:43:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:10,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948576245] [2024-10-11 23:43:10,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948576245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:10,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:10,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:43:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424698352] [2024-10-11 23:43:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:10,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 23:43:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 23:43:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 23:43:10,050 INFO L87 Difference]: Start difference. First operand has 431 states, 406 states have (on average 1.6305418719211822) internal successors, (662), 422 states have internal predecessors, (662), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-10-11 23:43:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:10,113 INFO L93 Difference]: Finished difference Result 859 states and 1396 transitions. [2024-10-11 23:43:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 23:43:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-10-11 23:43:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:10,127 INFO L225 Difference]: With dead ends: 859 [2024-10-11 23:43:10,128 INFO L226 Difference]: Without dead ends: 426 [2024-10-11 23:43:10,133 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-10-11 23:43:10,138 INFO L432 NwaCegarLoop]: 619 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:10,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:43:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-11 23:43:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-10-11 23:43:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 403 states have (on average 1.4590570719602978) internal successors, (588), 417 states have internal predecessors, (588), 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-10-11 23:43:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2024-10-11 23:43:10,197 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 5 [2024-10-11 23:43:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:10,198 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2024-10-11 23:43:10,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-10-11 23:43:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2024-10-11 23:43:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 23:43:10,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:10,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 23:43:10,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:43:10,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:10,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1534317143, now seen corresponding path program 1 times [2024-10-11 23:43:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:10,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032181947] [2024-10-11 23:43:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:43:10,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032181947] [2024-10-11 23:43:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032181947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:10,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:10,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:43:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059462117] [2024-10-11 23:43:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:10,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:43:10,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:10,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:43:10,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:43:10,267 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-10-11 23:43:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:10,337 INFO L93 Difference]: Finished difference Result 843 states and 1232 transitions. [2024-10-11 23:43:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:43:10,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-10-11 23:43:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:10,341 INFO L225 Difference]: With dead ends: 843 [2024-10-11 23:43:10,341 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 23:43:10,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 23:43:10,343 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 547 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:10,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1268 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:43:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 23:43:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 427. [2024-10-11 23:43:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.4579207920792079) internal successors, (589), 418 states have internal predecessors, (589), 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-10-11 23:43:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 621 transitions. [2024-10-11 23:43:10,372 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 621 transitions. Word has length 5 [2024-10-11 23:43:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:10,374 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 621 transitions. [2024-10-11 23:43:10,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-10-11 23:43:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 621 transitions. [2024-10-11 23:43:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 23:43:10,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:10,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 23:43:10,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:43:10,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash 276089154, now seen corresponding path program 1 times [2024-10-11 23:43:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986938543] [2024-10-11 23:43:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 23:43:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015375809] [2024-10-11 23:43:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:43:10,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:43:10,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 23:43:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:10,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:43:10,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:43:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:43:10,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:43:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986938543] [2024-10-11 23:43:10,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 23:43:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015375809] [2024-10-11 23:43:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015375809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 23:43:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809021094] [2024-10-11 23:43:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:10,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:43:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:43:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:43:10,563 INFO L87 Difference]: Start difference. First operand 427 states and 621 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-11 23:43:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:10,601 INFO L93 Difference]: Finished difference Result 813 states and 1181 transitions. [2024-10-11 23:43:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:43:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-11 23:43:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:10,606 INFO L225 Difference]: With dead ends: 813 [2024-10-11 23:43:10,606 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 23:43:10,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-11 23:43:10,607 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 543 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:10,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1269 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:43:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 23:43:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 431. [2024-10-11 23:43:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4534313725490196) internal successors, (593), 422 states have internal predecessors, (593), 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-10-11 23:43:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 625 transitions. [2024-10-11 23:43:10,624 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 625 transitions. Word has length 6 [2024-10-11 23:43:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:10,625 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 625 transitions. [2024-10-11 23:43:10,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-11 23:43:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 625 transitions. [2024-10-11 23:43:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 23:43:10,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:10,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:10,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 23:43:10,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:10,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:10,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash 747422870, now seen corresponding path program 1 times [2024-10-11 23:43:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613124999] [2024-10-11 23:43:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:43:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:11,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613124999] [2024-10-11 23:43:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613124999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 23:43:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998999481] [2024-10-11 23:43:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:43:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:43:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:43:11,332 INFO L87 Difference]: Start difference. First operand 431 states and 625 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-10-11 23:43:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:11,409 INFO L93 Difference]: Finished difference Result 859 states and 1247 transitions. [2024-10-11 23:43:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:43:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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 150 [2024-10-11 23:43:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:11,414 INFO L225 Difference]: With dead ends: 859 [2024-10-11 23:43:11,414 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 23:43:11,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:43:11,417 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 102 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1750 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:43:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 23:43:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2024-10-11 23:43:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4362745098039216) internal successors, (586), 422 states have internal predecessors, (586), 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-10-11 23:43:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 618 transitions. [2024-10-11 23:43:11,427 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 618 transitions. Word has length 150 [2024-10-11 23:43:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:11,427 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 618 transitions. [2024-10-11 23:43:11,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-10-11 23:43:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 618 transitions. [2024-10-11 23:43:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 23:43:11,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:11,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:11,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:43:11,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:11,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 652060706, now seen corresponding path program 1 times [2024-10-11 23:43:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243980340] [2024-10-11 23:43:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:43:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243980340] [2024-10-11 23:43:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243980340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:43:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649729544] [2024-10-11 23:43:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:11,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:43:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:43:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:43:11,638 INFO L87 Difference]: Start difference. First operand 431 states and 618 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-10-11 23:43:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:11,682 INFO L93 Difference]: Finished difference Result 862 states and 1239 transitions. [2024-10-11 23:43:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:43:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2024-10-11 23:43:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:11,685 INFO L225 Difference]: With dead ends: 862 [2024-10-11 23:43:11,685 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 23:43:11,686 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-10-11 23:43:11,687 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 1 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:11,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1187 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:43:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 23:43:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-10-11 23:43:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 414 states have (on average 1.429951690821256) internal successors, (592), 428 states have internal predecessors, (592), 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-10-11 23:43:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 624 transitions. [2024-10-11 23:43:11,697 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 624 transitions. Word has length 150 [2024-10-11 23:43:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:11,698 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 624 transitions. [2024-10-11 23:43:11,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-10-11 23:43:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 624 transitions. [2024-10-11 23:43:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 23:43:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:11,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:43:11,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:11,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 164013600, now seen corresponding path program 1 times [2024-10-11 23:43:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490834168] [2024-10-11 23:43:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:43:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490834168] [2024-10-11 23:43:11,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490834168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:11,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:11,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:43:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367678170] [2024-10-11 23:43:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:11,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:43:11,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:43:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:43:11,903 INFO L87 Difference]: Start difference. First operand 437 states and 624 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-10-11 23:43:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:11,953 INFO L93 Difference]: Finished difference Result 1001 states and 1435 transitions. [2024-10-11 23:43:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:43:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 150 [2024-10-11 23:43:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:11,956 INFO L225 Difference]: With dead ends: 1001 [2024-10-11 23:43:11,956 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 23:43:11,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 23:43:11,957 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 134 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:11,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1212 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:43:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 23:43:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-10-11 23:43:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 547 states have (on average 1.43327239488117) internal successors, (784), 561 states have internal predecessors, (784), 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-10-11 23:43:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 816 transitions. [2024-10-11 23:43:11,967 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 816 transitions. Word has length 150 [2024-10-11 23:43:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:11,967 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 816 transitions. [2024-10-11 23:43:11,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-10-11 23:43:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 816 transitions. [2024-10-11 23:43:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 23:43:11,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:11,969 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:43:11,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1623068823, now seen corresponding path program 1 times [2024-10-11 23:43:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265036500] [2024-10-11 23:43:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:12,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:43:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:12,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:43:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:43:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265036500] [2024-10-11 23:43:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265036500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:12,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 23:43:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979439380] [2024-10-11 23:43:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:43:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:43:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:43:12,275 INFO L87 Difference]: Start difference. First operand 570 states and 816 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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-10-11 23:43:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:12,588 INFO L93 Difference]: Finished difference Result 961 states and 1376 transitions. [2024-10-11 23:43:12,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 23:43:12,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 163 [2024-10-11 23:43:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:12,591 INFO L225 Difference]: With dead ends: 961 [2024-10-11 23:43:12,591 INFO L226 Difference]: Without dead ends: 530 [2024-10-11 23:43:12,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:43:12,592 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 35 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:12,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1868 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:43:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-11 23:43:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2024-10-11 23:43:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 505 states have (on average 1.4) internal successors, (707), 519 states have internal predecessors, (707), 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-10-11 23:43:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 739 transitions. [2024-10-11 23:43:12,602 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 739 transitions. Word has length 163 [2024-10-11 23:43:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:12,602 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 739 transitions. [2024-10-11 23:43:12,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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-10-11 23:43:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 739 transitions. [2024-10-11 23:43:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 23:43:12,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:12,604 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:12,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:43:12,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:12,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash -45596067, now seen corresponding path program 1 times [2024-10-11 23:43:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249873882] [2024-10-11 23:43:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:43:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:43:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:43:12,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249873882] [2024-10-11 23:43:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249873882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:43:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036798173] [2024-10-11 23:43:12,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:12,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:43:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:43:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:43:12,824 INFO L87 Difference]: Start difference. First operand 528 states and 739 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 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-10-11 23:43:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:13,215 INFO L93 Difference]: Finished difference Result 1065 states and 1489 transitions. [2024-10-11 23:43:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:43:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 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 163 [2024-10-11 23:43:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:13,219 INFO L225 Difference]: With dead ends: 1065 [2024-10-11 23:43:13,219 INFO L226 Difference]: Without dead ends: 676 [2024-10-11 23:43:13,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:43:13,221 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 248 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:13,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1439 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 23:43:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-11 23:43:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 674. [2024-10-11 23:43:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 648 states have (on average 1.3858024691358024) internal successors, (898), 662 states have internal predecessors, (898), 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-10-11 23:43:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 936 transitions. [2024-10-11 23:43:13,236 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 936 transitions. Word has length 163 [2024-10-11 23:43:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:13,237 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 936 transitions. [2024-10-11 23:43:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 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-10-11 23:43:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 936 transitions. [2024-10-11 23:43:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 23:43:13,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:13,242 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:13,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:43:13,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:13,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1255446482, now seen corresponding path program 1 times [2024-10-11 23:43:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454529457] [2024-10-11 23:43:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:43:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:43:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 23:43:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 23:43:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:43:13,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454529457] [2024-10-11 23:43:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454529457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:13,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:43:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009254029] [2024-10-11 23:43:13,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:13,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:43:13,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:13,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:43:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:43:13,555 INFO L87 Difference]: Start difference. First operand 674 states and 936 transitions. Second operand has 5 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:13,854 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2024-10-11 23:43:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:43:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 176 [2024-10-11 23:43:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:13,857 INFO L225 Difference]: With dead ends: 676 [2024-10-11 23:43:13,858 INFO L226 Difference]: Without dead ends: 675 [2024-10-11 23:43:13,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-11 23:43:13,859 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 306 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:13,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1460 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:43:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-11 23:43:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2024-10-11 23:43:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 648 states have (on average 1.3842592592592593) internal successors, (897), 661 states have internal predecessors, (897), 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-10-11 23:43:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 935 transitions. [2024-10-11 23:43:13,875 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 935 transitions. Word has length 176 [2024-10-11 23:43:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:13,875 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 935 transitions. [2024-10-11 23:43:13,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 935 transitions. [2024-10-11 23:43:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 23:43:13,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:13,877 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:13,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:43:13,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -264133761, now seen corresponding path program 1 times [2024-10-11 23:43:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489670779] [2024-10-11 23:43:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:43:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:43:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 23:43:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 23:43:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:43:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:14,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489670779] [2024-10-11 23:43:14,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489670779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:14,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:43:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093517964] [2024-10-11 23:43:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:14,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:43:14,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:43:14,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:43:14,109 INFO L87 Difference]: Start difference. First operand 673 states and 935 transitions. Second operand has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:14,472 INFO L93 Difference]: Finished difference Result 740 states and 1034 transitions. [2024-10-11 23:43:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:43:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2024-10-11 23:43:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:14,476 INFO L225 Difference]: With dead ends: 740 [2024-10-11 23:43:14,476 INFO L226 Difference]: Without dead ends: 739 [2024-10-11 23:43:14,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-11 23:43:14,477 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 299 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:14,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 2039 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:43:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-11 23:43:14,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2024-10-11 23:43:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 709 states have (on average 1.375176304654443) internal successors, (975), 722 states have internal predecessors, (975), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 23:43:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1019 transitions. [2024-10-11 23:43:14,490 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1019 transitions. Word has length 177 [2024-10-11 23:43:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1019 transitions. [2024-10-11 23:43:14,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1019 transitions. [2024-10-11 23:43:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 23:43:14,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:14,492 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 23:43:14,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -404396836, now seen corresponding path program 1 times [2024-10-11 23:43:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814996433] [2024-10-11 23:43:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:43:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:43:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 23:43:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 23:43:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 23:43:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814996433] [2024-10-11 23:43:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814996433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:43:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104803123] [2024-10-11 23:43:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:14,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:43:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:14,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:43:14,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:43:14,741 INFO L87 Difference]: Start difference. First operand 737 states and 1019 transitions. Second operand has 5 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:15,113 INFO L93 Difference]: Finished difference Result 763 states and 1075 transitions. [2024-10-11 23:43:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:43:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2024-10-11 23:43:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:15,116 INFO L225 Difference]: With dead ends: 763 [2024-10-11 23:43:15,116 INFO L226 Difference]: Without dead ends: 761 [2024-10-11 23:43:15,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:43:15,117 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 341 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:15,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1436 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:43:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-11 23:43:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 740. [2024-10-11 23:43:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 712 states have (on average 1.3735955056179776) internal successors, (978), 725 states have internal predecessors, (978), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 23:43:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1022 transitions. [2024-10-11 23:43:15,153 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1022 transitions. Word has length 181 [2024-10-11 23:43:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:15,153 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1022 transitions. [2024-10-11 23:43:15,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1022 transitions. [2024-10-11 23:43:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 23:43:15,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:15,156 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 23:43:15,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 305497949, now seen corresponding path program 1 times [2024-10-11 23:43:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490607844] [2024-10-11 23:43:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:43:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:43:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:16,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 23:43:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 23:43:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 23:43:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490607844] [2024-10-11 23:43:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490607844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:43:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619136257] [2024-10-11 23:43:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:16,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:16,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:43:16,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:43:16,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 23:43:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:16,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 23:43:16,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:43:16,509 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-10-11 23:43:16,525 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-10-11 23:43:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:43:17,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:43:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619136257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:43:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2024-10-11 23:43:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174660620] [2024-10-11 23:43:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 23:43:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 23:43:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 23:43:17,222 INFO L87 Difference]: Start difference. First operand 740 states and 1022 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:18,788 INFO L93 Difference]: Finished difference Result 1425 states and 1962 transitions. [2024-10-11 23:43:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 23:43:18,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2024-10-11 23:43:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:18,791 INFO L225 Difference]: With dead ends: 1425 [2024-10-11 23:43:18,791 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 23:43:18,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 23:43:18,792 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 715 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:18,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 3049 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 23:43:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 23:43:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 772. [2024-10-11 23:43:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 744 states have (on average 1.364247311827957) internal successors, (1015), 757 states have internal predecessors, (1015), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 23:43:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1059 transitions. [2024-10-11 23:43:18,808 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1059 transitions. Word has length 182 [2024-10-11 23:43:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1059 transitions. [2024-10-11 23:43:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1059 transitions. [2024-10-11 23:43:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 23:43:18,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:18,810 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:18,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 23:43:19,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:19,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2066941912, now seen corresponding path program 1 times [2024-10-11 23:43:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975241921] [2024-10-11 23:43:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 23:43:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:19,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 23:43:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:19,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 23:43:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 23:43:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 23:43:19,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975241921] [2024-10-11 23:43:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975241921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:43:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608228538] [2024-10-11 23:43:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:43:19,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:43:19,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 23:43:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:20,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 23:43:20,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:43:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:43:20,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:43:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608228538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:43:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 23:43:20,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902600747] [2024-10-11 23:43:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:43:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:43:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:43:20,105 INFO L87 Difference]: Start difference. First operand 772 states and 1059 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:20,279 INFO L93 Difference]: Finished difference Result 1470 states and 2020 transitions. [2024-10-11 23:43:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:43:20,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2024-10-11 23:43:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:20,282 INFO L225 Difference]: With dead ends: 1470 [2024-10-11 23:43:20,282 INFO L226 Difference]: Without dead ends: 822 [2024-10-11 23:43:20,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:43:20,283 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 17 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:20,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1363 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 23:43:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-11 23:43:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 806. [2024-10-11 23:43:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 778 states have (on average 1.3560411311053984) internal successors, (1055), 791 states have internal predecessors, (1055), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 23:43:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1099 transitions. [2024-10-11 23:43:20,299 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1099 transitions. Word has length 183 [2024-10-11 23:43:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:20,299 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1099 transitions. [2024-10-11 23:43:20,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1099 transitions. [2024-10-11 23:43:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 23:43:20,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:20,301 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:20,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 23:43:20,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:20,506 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:20,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 175511192, now seen corresponding path program 1 times [2024-10-11 23:43:20,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:20,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658005022] [2024-10-11 23:43:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:20,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 23:43:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 23:43:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 23:43:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:20,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 23:43:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:43:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658005022] [2024-10-11 23:43:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658005022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:20,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 23:43:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236280096] [2024-10-11 23:43:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:20,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 23:43:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 23:43:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:43:20,890 INFO L87 Difference]: Start difference. First operand 806 states and 1099 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:21,537 INFO L93 Difference]: Finished difference Result 1498 states and 2060 transitions. [2024-10-11 23:43:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:43:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2024-10-11 23:43:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:21,541 INFO L225 Difference]: With dead ends: 1498 [2024-10-11 23:43:21,541 INFO L226 Difference]: Without dead ends: 820 [2024-10-11 23:43:21,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:43:21,543 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 13 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:21,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2044 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 23:43:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-10-11 23:43:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 814. [2024-10-11 23:43:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 786 states have (on average 1.3549618320610688) internal successors, (1065), 799 states have internal predecessors, (1065), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 23:43:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1109 transitions. [2024-10-11 23:43:21,558 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1109 transitions. Word has length 184 [2024-10-11 23:43:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:21,559 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1109 transitions. [2024-10-11 23:43:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1109 transitions. [2024-10-11 23:43:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 23:43:21,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:21,560 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:21,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 23:43:21,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2143086609, now seen corresponding path program 1 times [2024-10-11 23:43:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525138011] [2024-10-11 23:43:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:21,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:43:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:21,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 23:43:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 23:43:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 23:43:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 23:43:21,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525138011] [2024-10-11 23:43:21,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525138011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:21,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:43:21,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 23:43:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007023821] [2024-10-11 23:43:21,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:21,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 23:43:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 23:43:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 23:43:21,892 INFO L87 Difference]: Start difference. First operand 814 states and 1109 transitions. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:22,662 INFO L93 Difference]: Finished difference Result 1513 states and 2080 transitions. [2024-10-11 23:43:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 23:43:22,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2024-10-11 23:43:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:22,666 INFO L225 Difference]: With dead ends: 1513 [2024-10-11 23:43:22,666 INFO L226 Difference]: Without dead ends: 838 [2024-10-11 23:43:22,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 23:43:22,667 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 17 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:22,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2737 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 23:43:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-10-11 23:43:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 830. [2024-10-11 23:43:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 802 states have (on average 1.355361596009975) internal successors, (1087), 815 states have internal predecessors, (1087), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 23:43:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1131 transitions. [2024-10-11 23:43:22,683 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1131 transitions. Word has length 185 [2024-10-11 23:43:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:22,683 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1131 transitions. [2024-10-11 23:43:22,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 23:43:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1131 transitions. [2024-10-11 23:43:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 23:43:22,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:22,685 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:22,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 23:43:22,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1273729781, now seen corresponding path program 1 times [2024-10-11 23:43:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133122045] [2024-10-11 23:43:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:43:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 23:43:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 23:43:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 23:43:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 23:43:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133122045] [2024-10-11 23:43:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133122045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:43:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964685823] [2024-10-11 23:43:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:43:23,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:43:23,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 23:43:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:23,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 23:43:23,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:43:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 23:43:23,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:43:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964685823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:43:23,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:43:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-11 23:43:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328971157] [2024-10-11 23:43:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:43:23,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:43:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:43:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:43:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:43:23,970 INFO L87 Difference]: Start difference. First operand 830 states and 1131 transitions. Second operand has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 23:43:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:43:24,013 INFO L93 Difference]: Finished difference Result 1475 states and 2020 transitions. [2024-10-11 23:43:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:43:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 185 [2024-10-11 23:43:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:43:24,016 INFO L225 Difference]: With dead ends: 1475 [2024-10-11 23:43:24,016 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 23:43:24,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:43:24,018 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 0 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:43:24,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1562 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:43:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 23:43:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-11 23:43:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 803 states have (on average 1.356164383561644) internal successors, (1089), 817 states have internal predecessors, (1089), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-11 23:43:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1137 transitions. [2024-10-11 23:43:24,051 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1137 transitions. Word has length 185 [2024-10-11 23:43:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:43:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1137 transitions. [2024-10-11 23:43:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 4 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 23:43:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1137 transitions. [2024-10-11 23:43:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-11 23:43:24,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:43:24,054 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 23:43:24,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 23:43:24,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 23:43:24,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:43:24,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:43:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash -75941819, now seen corresponding path program 1 times [2024-10-11 23:43:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:43:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085892379] [2024-10-11 23:43:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:24,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:43:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:43:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 23:43:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:30,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 23:43:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 23:43:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 23:43:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:43:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085892379] [2024-10-11 23:43:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085892379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:43:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174933406] [2024-10-11 23:43:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:43:30,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:43:30,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:43:30,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:43:30,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 23:43:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:43:31,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 169 conjuncts are in the unsatisfiable core [2024-10-11 23:43:31,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:43:31,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-10-11 23:43:31,359 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-10-11 23:43:31,596 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 32 treesize of output 27 [2024-10-11 23:43:31,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2024-10-11 23:43:31,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-11 23:43:31,652 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-10-11 23:43:31,657 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 15 treesize of output 1 [2024-10-11 23:43:31,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 23:43:31,680 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-11 23:43:31,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 23:43:31,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2024-10-11 23:43:31,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 23:43:31,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 23:43:31,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2024-10-11 23:43:31,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-11 23:43:32,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-10-11 23:43:38,277 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 14346 DAG size of output: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-11 23:43:38,277 INFO L349 Elim1Store]: treesize reduction 423940, result has 0.0 percent of original size [2024-10-11 23:43:38,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 86 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 124 new quantified variables, introduced 1968 case distinctions, treesize of input 2386702 treesize of output 1324591 [2024-10-11 23:43:45,767 WARN L286 SmtUtils]: Spent 7.43s on a formula simplification. DAG size of input: 21584 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 23:43:54,872 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 17327 DAG size of output: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-11 23:43:54,872 INFO L349 Elim1Store]: treesize reduction 727885, result has 0.0 percent of original size [2024-10-11 23:43:54,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 93 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 133 new quantified variables, introduced 2256 case distinctions, treesize of input 5212732 treesize of output 2601774 [2024-10-11 23:44:05,898 WARN L286 SmtUtils]: Spent 10.94s on a formula simplification. DAG size of input: 27794 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 23:44:14,465 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification. DAG size of input: 17327 DAG size of output: 1 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-11 23:44:14,465 INFO L349 Elim1Store]: treesize reduction 727885, result has 0.0 percent of original size [2024-10-11 23:44:14,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 93 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 133 new quantified variables, introduced 2256 case distinctions, treesize of input 5243283 treesize of output 2627107 [2024-10-11 23:44:20,318 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 27770 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 23:44:25,702 INFO L349 Elim1Store]: treesize reduction 368646, result has 0.0 percent of original size [2024-10-11 23:44:25,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 77 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 113 new quantified variables, introduced 1683 case distinctions, treesize of input 2247412 treesize of output 1154435