./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:24:54,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:24:54,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:24:54,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:24:54,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:24:54,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:24:54,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:24:54,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:24:54,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:24:54,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:24:54,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:24:54,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:24:54,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:24:54,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:24:54,205 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:24:54,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:24:54,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:24:54,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:24:54,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:24:54,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:24:54,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:24:54,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:24:54,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:24:54,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:24:54,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:24:54,209 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:24:54,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:24:54,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:24:54,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:24:54,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:24:54,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:24:54,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:24:54,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:24:54,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:24:54,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:24:54,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:24:54,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:24:54,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:24:54,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:24:54,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:24:54,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:24:54,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:24:54,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:24:54,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:24:54,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2024-11-09 11:24:54,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:24:54,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:24:54,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:24:54,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:24:54,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:24:54,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-09 11:24:55,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:24:56,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:24:56,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2024-11-09 11:24:56,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08950ca34/bde5f60d020e420eaf72c7f44f4db31a/FLAG3beb58dc5 [2024-11-09 11:24:56,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08950ca34/bde5f60d020e420eaf72c7f44f4db31a [2024-11-09 11:24:56,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:24:56,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:24:56,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:24:56,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:24:56,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:24:56,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bbc70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56, skipping insertion in model container [2024-11-09 11:24:56,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:24:56,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:24:56,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:24:56,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:24:56,782 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:24:56,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56 WrapperNode [2024-11-09 11:24:56,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:24:56,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:24:56,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:24:56,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:24:56,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,829 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-11-09 11:24:56,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:24:56,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:24:56,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:24:56,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:24:56,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,859 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 7 writes are split as follows [0, 2, 5]. [2024-11-09 11:24:56,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:24:56,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:24:56,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:24:56,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:24:56,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (1/1) ... [2024-11-09 11:24:56,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:24:56,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:56,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:24:56,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:24:56,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:24:56,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:24:56,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 11:24:56,983 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 11:24:56,983 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 11:24:56,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:24:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:24:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 11:24:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 11:24:56,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 11:24:56,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 11:24:56,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 11:24:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:24:56,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:24:57,276 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:24:57,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:24:57,569 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-09 11:24:57,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:24:57,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:24:57,588 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 11:24:57,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:24:57 BoogieIcfgContainer [2024-11-09 11:24:57,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:24:57,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:24:57,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:24:57,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:24:57,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:24:56" (1/3) ... [2024-11-09 11:24:57,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c52efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:57, skipping insertion in model container [2024-11-09 11:24:57,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:56" (2/3) ... [2024-11-09 11:24:57,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c52efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:57, skipping insertion in model container [2024-11-09 11:24:57,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:24:57" (3/3) ... [2024-11-09 11:24:57,598 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2024-11-09 11:24:57,612 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:24:57,612 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:24:57,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:24:57,694 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;@258e1cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:24:57,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:24:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 33 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:24:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:24:57,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:57,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:57,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:57,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash -432996556, now seen corresponding path program 1 times [2024-11-09 11:24:57,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:57,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226605734] [2024-11-09 11:24:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:24:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226605734] [2024-11-09 11:24:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226605734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:24:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708033213] [2024-11-09 11:24:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:58,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:24:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:58,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:24:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:24:58,057 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 33 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:24:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:58,104 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-11-09 11:24:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:24:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 11:24:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:58,112 INFO L225 Difference]: With dead ends: 56 [2024-11-09 11:24:58,112 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 11:24:58,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:24:58,118 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:58,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 11:24:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 11:24:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:24:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 11:24:58,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2024-11-09 11:24:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 11:24:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:24:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 11:24:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:24:58,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:58,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:24:58,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:58,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash -718098774, now seen corresponding path program 1 times [2024-11-09 11:24:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27070807] [2024-11-09 11:24:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:24:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27070807] [2024-11-09 11:24:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27070807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:58,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149563923] [2024-11-09 11:24:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:58,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:24:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:58,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:24:58,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:24:58,381 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:24:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:58,422 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-09 11:24:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:24:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 11:24:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:58,423 INFO L225 Difference]: With dead ends: 43 [2024-11-09 11:24:58,423 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 11:24:58,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:24:58,424 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:58,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 11:24:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 11:24:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:24:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 11:24:58,435 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2024-11-09 11:24:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:58,436 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 11:24:58,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:24:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 11:24:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 11:24:58,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:58,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:58,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:24:58,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:58,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash 989400737, now seen corresponding path program 1 times [2024-11-09 11:24:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:58,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193290968] [2024-11-09 11:24:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:24:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193290968] [2024-11-09 11:24:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193290968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716949118] [2024-11-09 11:24:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:58,659 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:58,723 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-09 11:24:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-11-09 11:24:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:58,725 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:24:58,725 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:24:58,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:58,727 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:58,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:24:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-09 11:24:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-09 11:24:58,735 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 18 [2024-11-09 11:24:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:58,736 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-09 11:24:58,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-09 11:24:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 11:24:58,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:58,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:58,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:24:58,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:58,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 606651824, now seen corresponding path program 1 times [2024-11-09 11:24:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:58,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912293075] [2024-11-09 11:24:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:24:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912293075] [2024-11-09 11:24:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912293075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:58,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263421416] [2024-11-09 11:24:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:58,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:58,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:58,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:58,874 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:58,909 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 11:24:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2024-11-09 11:24:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:58,910 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:24:58,910 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:24:58,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:58,912 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:58,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:24:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 11:24:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.28) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-09 11:24:58,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2024-11-09 11:24:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:58,916 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-09 11:24:58,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-09 11:24:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:24:58,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:58,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:58,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:24:58,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:58,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash -408685248, now seen corresponding path program 1 times [2024-11-09 11:24:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:58,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393764614] [2024-11-09 11:24:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:24:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:59,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393764614] [2024-11-09 11:24:59,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393764614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:59,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:59,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:59,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899494741] [2024-11-09 11:24:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:59,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:59,003 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:59,034 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-09 11:24:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 26 [2024-11-09 11:24:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:59,035 INFO L225 Difference]: With dead ends: 43 [2024-11-09 11:24:59,035 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 11:24:59,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:59,036 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:59,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 92 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 11:24:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 11:24:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-09 11:24:59,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 26 [2024-11-09 11:24:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:59,041 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 11:24:59,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-09 11:24:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 11:24:59,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:59,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:24:59,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1983055799, now seen corresponding path program 1 times [2024-11-09 11:24:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887193874] [2024-11-09 11:24:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:24:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:24:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887193874] [2024-11-09 11:24:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887193874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878724115] [2024-11-09 11:24:59,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:59,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:59,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:59,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:59,120 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:59,151 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-09 11:24:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-09 11:24:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:59,152 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:24:59,153 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:24:59,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:59,153 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:59,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:24:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 11:24:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-09 11:24:59,157 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2024-11-09 11:24:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:59,158 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-09 11:24:59,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-09 11:24:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:24:59,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:59,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:59,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:24:59,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:59,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1345187674, now seen corresponding path program 1 times [2024-11-09 11:24:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060016431] [2024-11-09 11:24:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:24:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:24:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060016431] [2024-11-09 11:24:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060016431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859011268] [2024-11-09 11:24:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:59,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:59,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:59,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:24:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:24:59,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:24:59,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:24:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859011268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:24:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-09 11:24:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831720896] [2024-11-09 11:24:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:59,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:24:59,463 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:59,482 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-11-09 11:24:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:59,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-09 11:24:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:59,483 INFO L225 Difference]: With dead ends: 66 [2024-11-09 11:24:59,483 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 11:24:59,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:24:59,483 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:59,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 11:24:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 11:24:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:24:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 11:24:59,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 29 [2024-11-09 11:24:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:59,488 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 11:24:59,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 11:24:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:24:59,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:59,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:59,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:24:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:59,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:24:59,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash -339239810, now seen corresponding path program 1 times [2024-11-09 11:24:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933138754] [2024-11-09 11:24:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:24:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933138754] [2024-11-09 11:24:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933138754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704794029] [2024-11-09 11:24:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:59,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:59,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:59,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:24:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:24:59,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:24:59,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:24:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704794029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:24:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-09 11:24:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140255184] [2024-11-09 11:24:59,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:59,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:24:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:59,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:24:59,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:59,946 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:59,964 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-09 11:24:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:24:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 31 [2024-11-09 11:24:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:59,965 INFO L225 Difference]: With dead ends: 35 [2024-11-09 11:24:59,965 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 11:24:59,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:59,966 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:59,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 11:24:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 11:24:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:24:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 11:24:59,969 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2024-11-09 11:24:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:59,969 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 11:24:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 11:24:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:24:59,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:59,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:59,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:25:00,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 11:25:00,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:25:00,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1926499429, now seen corresponding path program 1 times [2024-11-09 11:25:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998981483] [2024-11-09 11:25:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998981483] [2024-11-09 11:25:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998981483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451714091] [2024-11-09 11:25:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:00,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:00,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:00,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:25:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:25:00,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:00,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:25:00,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451714091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:00,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:00,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-09 11:25:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838467213] [2024-11-09 11:25:00,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 11:25:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:00,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 11:25:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:00,568 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:00,615 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2024-11-09 11:25:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:25:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-09 11:25:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:00,617 INFO L225 Difference]: With dead ends: 59 [2024-11-09 11:25:00,617 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 11:25:00,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:00,617 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:00,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 159 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 11:25:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 11:25:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:25:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-11-09 11:25:00,622 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 32 [2024-11-09 11:25:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:00,622 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-11-09 11:25:00,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:25:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-09 11:25:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:25:00,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:00,623 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:00,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:25:00,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:00,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:25:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash 980821401, now seen corresponding path program 2 times [2024-11-09 11:25:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412577081] [2024-11-09 11:25:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 11:25:00,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412577081] [2024-11-09 11:25:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412577081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481464039] [2024-11-09 11:25:00,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:00,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:00,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:25:01,120 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:25:01,120 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:01,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:25:01,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:25:01,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:25:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481464039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:01,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-09 11:25:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589773142] [2024-11-09 11:25:01,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:25:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:25:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:25:01,343 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:25:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:01,394 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-09 11:25:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:25:01,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2024-11-09 11:25:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:01,395 INFO L225 Difference]: With dead ends: 58 [2024-11-09 11:25:01,395 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:25:01,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:01,396 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:01,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:25:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:25:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:25:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:25:01,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-11-09 11:25:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:01,397 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:25:01,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:25:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:25:01,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:25:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:25:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:25:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:25:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:25:01,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:25:01,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:01,603 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:01,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:25:01,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:25:01,681 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-09 11:25:01,682 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-09 11:25:01,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-09 11:25:01,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-09 11:25:01,685 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-09 11:25:01,691 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-09 11:25:01,691 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-09 11:25:01,691 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-09 11:25:01,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:25:01 BoogieIcfgContainer [2024-11-09 11:25:01,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:25:01,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:25:01,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:25:01,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:25:01,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:24:57" (3/4) ... [2024-11-09 11:25:01,695 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:25:01,699 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-09 11:25:01,702 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 11:25:01,702 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 11:25:01,702 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:25:01,702 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:25:01,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:25:01,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:25:01,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:25:01,773 INFO L158 Benchmark]: Toolchain (without parser) took 5397.75ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 102.7MB in the beginning and 103.3MB in the end (delta: -575.7kB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,773 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 64.7MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:25:01,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.14ms. Allocated memory is still 155.2MB. Free memory was 102.7MB in the beginning and 121.1MB in the end (delta: -18.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.49ms. Allocated memory is still 155.2MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,774 INFO L158 Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 115.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,774 INFO L158 Benchmark]: RCFGBuilder took 705.56ms. Allocated memory is still 155.2MB. Free memory was 115.8MB in the beginning and 112.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,774 INFO L158 Benchmark]: TraceAbstraction took 4102.38ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 111.4MB in the beginning and 108.5MB in the end (delta: 2.8MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,774 INFO L158 Benchmark]: Witness Printer took 79.68ms. Allocated memory is still 192.9MB. Free memory was 108.5MB in the beginning and 103.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:25:01,775 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 64.7MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.14ms. Allocated memory is still 155.2MB. Free memory was 102.7MB in the beginning and 121.1MB in the end (delta: -18.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.49ms. Allocated memory is still 155.2MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.73ms. Allocated memory is still 155.2MB. Free memory was 119.0MB in the beginning and 115.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 705.56ms. Allocated memory is still 155.2MB. Free memory was 115.8MB in the beginning and 112.4MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4102.38ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 111.4MB in the beginning and 108.5MB in the end (delta: 2.8MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * Witness Printer took 79.68ms. Allocated memory is still 192.9MB. Free memory was 108.5MB in the beginning and 103.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 904 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 630 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 274 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 401 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1040 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 227/296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((1 <= i) && (i <= 2147483646)) && (len <= 2)) || ((i == 0) && (len <= 2))) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 2) && (len <= 1)) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:25:01,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE