./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for overflows
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 20:49:08,992 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 20:49:09,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf
[2024-11-07 20:49:09,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 20:49:09,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 20:49:09,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 20:49:09,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 20:49:09,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 20:49:09,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 20:49:09,070 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 20:49:09,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 20:49:09,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 20:49:09,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 20:49:09,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 20:49:09,070 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 20:49:09,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 20:49:09,071 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 20:49:09,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 20:49:09,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:49:09,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 20:49:09,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 20:49:09,074 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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-jdk21/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 -> 93288430628c47f5b29fea9bae87a960ba351b35fa235fa55fc142299145054c
[2024-11-07 20:49:09,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 20:49:09,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 20:49:09,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 20:49:09,291 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 20:49:09,291 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 20:49:09,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c
[2024-11-07 20:49:10,432 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 20:49:10,615 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 20:49:10,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound1.c
[2024-11-07 20:49:10,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0031c291/06ef7f37b4d1417fbe014fa76f28ca2e/FLAG3e565dc08
[2024-11-07 20:49:10,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0031c291/06ef7f37b4d1417fbe014fa76f28ca2e
[2024-11-07 20:49:10,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 20:49:10,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 20:49:10,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 20:49:10,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 20:49:10,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 20:49:10,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:49:10" (1/1) ...
[2024-11-07 20:49:10,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c0994c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:10, skipping insertion in model container
[2024-11-07 20:49:10,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:49:10" (1/1) ...
[2024-11-07 20:49:11,007 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 20:49:11,104 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:49:11,110 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 20:49:11,122 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:49:11,130 INFO L204 MainTranslator]: Completed translation
[2024-11-07 20:49:11,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11 WrapperNode
[2024-11-07 20:49:11,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 20:49:11,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 20:49:11,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 20:49:11,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 20:49:11,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,165 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153
[2024-11-07 20:49:11,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 20:49:11,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 20:49:11,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 20:49:11,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 20:49:11,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,180 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 20:49:11,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 20:49:11,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 20:49:11,187 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 20:49:11,187 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 20:49:11,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (1/1) ...
[2024-11-07 20:49:11,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:49:11,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:49:11,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 20:49:11,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 20:49:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 20:49:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 20:49:11,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 20:49:11,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 20:49:11,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-07 20:49:11,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-07 20:49:11,267 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 20:49:11,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 20:49:11,707 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live.
[2024-11-07 20:49:11,707 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 20:49:11,722 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 20:49:11,723 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 20:49:11,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:49:11 BoogieIcfgContainer
[2024-11-07 20:49:11,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 20:49:11,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 20:49:11,726 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 20:49:11,729 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 20:49:11,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:49:10" (1/3) ...
[2024-11-07 20:49:11,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a16383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:49:11, skipping insertion in model container
[2024-11-07 20:49:11,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:49:11" (2/3) ...
[2024-11-07 20:49:11,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a16383d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:49:11, skipping insertion in model container
[2024-11-07 20:49:11,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:49:11" (3/3) ...
[2024-11-07 20:49:11,731 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound1.c
[2024-11-07 20:49:11,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 20:49:11,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations.
[2024-11-07 20:49:11,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 20:49:11,792 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;@898c53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 20:49:11,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations.
[2024-11-07 20:49:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 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-07 20:49:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-07 20:49:11,799 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:11,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:11,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times
[2024-11-07 20:49:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145835413]
[2024-11-07 20:49:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:11,885 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-07 20:49:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145835413]
[2024-11-07 20:49:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145835413] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:11,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:49:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154340062]
[2024-11-07 20:49:11,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 20:49:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 20:49:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 20:49:11,904 INFO L87 Difference]: Start difference. First operand has 228 states, 119 states have (on average 1.915966386554622) internal successors, (228), 223 states have internal predecessors, (228), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:49:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:11,929 INFO L93 Difference]: Finished difference Result 427 states and 466 transitions.
[2024-11-07 20:49:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 20:49:11,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-07 20:49:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:11,936 INFO L225 Difference]: With dead ends: 427
[2024-11-07 20:49:11,936 INFO L226 Difference]: Without dead ends: 196
[2024-11-07 20:49:11,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 20:49:11,945 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:11,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:49:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2024-11-07 20:49:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196.
[2024-11-07 20:49:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 114 states have (on average 1.7017543859649122) internal successors, (194), 192 states have internal predecessors, (194), 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-07 20:49:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions.
[2024-11-07 20:49:11,990 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 6
[2024-11-07 20:49:11,990 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:11,990 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions.
[2024-11-07 20:49:11,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:49:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions.
[2024-11-07 20:49:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-07 20:49:11,991 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:11,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:11,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 20:49:11,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times
[2024-11-07 20:49:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170771214]
[2024-11-07 20:49:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:12,057 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-07 20:49:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170771214]
[2024-11-07 20:49:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170771214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:12,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:12,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:49:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224801728]
[2024-11-07 20:49:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:12,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:12,059 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:49:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:12,108 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions.
[2024-11-07 20:49:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 20:49:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-07 20:49:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:12,109 INFO L225 Difference]: With dead ends: 196
[2024-11-07 20:49:12,109 INFO L226 Difference]: Without dead ends: 195
[2024-11-07 20:49:12,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:49:12,110 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 194 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:12,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:49:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states.
[2024-11-07 20:49:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195.
[2024-11-07 20:49:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 191 states have internal predecessors, (193), 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-07 20:49:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions.
[2024-11-07 20:49:12,124 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 6
[2024-11-07 20:49:12,124 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:12,124 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions.
[2024-11-07 20:49:12,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:49:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions.
[2024-11-07 20:49:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-07 20:49:12,124 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:12,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:12,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 20:49:12,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:12,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times
[2024-11-07 20:49:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:12,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156180283]
[2024-11-07 20:49:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:12,160 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-07 20:49:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156180283]
[2024-11-07 20:49:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156180283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:49:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558503036]
[2024-11-07 20:49:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:12,162 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:49:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:12,192 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions.
[2024-11-07 20:49:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:49:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2024-11-07 20:49:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:12,194 INFO L225 Difference]: With dead ends: 285
[2024-11-07 20:49:12,194 INFO L226 Difference]: Without dead ends: 199
[2024-11-07 20:49:12,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:49:12,195 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:12,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:49:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states.
[2024-11-07 20:49:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199.
[2024-11-07 20:49:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 118 states have (on average 1.6694915254237288) internal successors, (197), 195 states have internal predecessors, (197), 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-07 20:49:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions.
[2024-11-07 20:49:12,207 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 7
[2024-11-07 20:49:12,207 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:12,207 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions.
[2024-11-07 20:49:12,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:49:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions.
[2024-11-07 20:49:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-07 20:49:12,208 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:12,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:12,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 20:49:12,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:12,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1182784684, now seen corresponding path program 1 times
[2024-11-07 20:49:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:12,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628324552]
[2024-11-07 20:49:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:12,263 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-07 20:49:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:12,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628324552]
[2024-11-07 20:49:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628324552] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:12,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:12,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:49:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901974165]
[2024-11-07 20:49:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:12,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 20:49:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 20:49:12,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 20:49:12,265 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-07 20:49:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:12,823 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions.
[2024-11-07 20:49:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 20:49:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9
[2024-11-07 20:49:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:12,825 INFO L225 Difference]: With dead ends: 359
[2024-11-07 20:49:12,827 INFO L226 Difference]: Without dead ends: 295
[2024-11-07 20:49:12,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 20:49:12,828 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:12,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 141 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 20:49:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2024-11-07 20:49:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289.
[2024-11-07 20:49:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 207 states have (on average 1.429951690821256) internal successors, (296), 284 states have internal predecessors, (296), 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-07 20:49:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 302 transitions.
[2024-11-07 20:49:12,842 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 302 transitions. Word has length 9
[2024-11-07 20:49:12,842 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:12,842 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 302 transitions.
[2024-11-07 20:49:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-07 20:49:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 302 transitions.
[2024-11-07 20:49:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2024-11-07 20:49:12,843 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:12,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:12,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 20:49:12,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1158660914, now seen corresponding path program 1 times
[2024-11-07 20:49:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781715922]
[2024-11-07 20:49:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:12,952 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-07 20:49:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781715922]
[2024-11-07 20:49:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781715922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:49:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414363709]
[2024-11-07 20:49:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 20:49:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 20:49:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 20:49:12,953 INFO L87 Difference]: Start difference. First operand 289 states and 302 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-07 20:49:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:13,005 INFO L93 Difference]: Finished difference Result 313 states and 320 transitions.
[2024-11-07 20:49:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 20:49:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47
[2024-11-07 20:49:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:13,007 INFO L225 Difference]: With dead ends: 313
[2024-11-07 20:49:13,007 INFO L226 Difference]: Without dead ends: 306
[2024-11-07 20:49:13,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 20:49:13,008 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:13,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:49:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2024-11-07 20:49:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 288.
[2024-11-07 20:49:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.4029126213592233) internal successors, (289), 283 states have internal predecessors, (289), 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-07 20:49:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 295 transitions.
[2024-11-07 20:49:13,023 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 295 transitions. Word has length 47
[2024-11-07 20:49:13,023 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 295 transitions.
[2024-11-07 20:49:13,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-07 20:49:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 295 transitions.
[2024-11-07 20:49:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2024-11-07 20:49:13,023 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:13,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:13,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 20:49:13,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1076612948, now seen corresponding path program 1 times
[2024-11-07 20:49:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595078957]
[2024-11-07 20:49:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:13,151 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-07 20:49:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595078957]
[2024-11-07 20:49:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595078957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:13,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 20:49:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610649300]
[2024-11-07 20:49:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:13,156 INFO L87 Difference]: Start difference. First operand 288 states and 295 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-07 20:49:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:13,313 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions.
[2024-11-07 20:49:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 20:49:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49
[2024-11-07 20:49:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:13,317 INFO L225 Difference]: With dead ends: 308
[2024-11-07 20:49:13,317 INFO L226 Difference]: Without dead ends: 265
[2024-11-07 20:49:13,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:13,318 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 154 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:13,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 20:49:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2024-11-07 20:49:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247.
[2024-11-07 20:49:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 165 states have (on average 1.490909090909091) internal successors, (246), 242 states have internal predecessors, (246), 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-07 20:49:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 252 transitions.
[2024-11-07 20:49:13,329 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 252 transitions. Word has length 49
[2024-11-07 20:49:13,329 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:13,329 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 252 transitions.
[2024-11-07 20:49:13,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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-07 20:49:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 252 transitions.
[2024-11-07 20:49:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2024-11-07 20:49:13,331 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:13,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:13,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 20:49:13,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1058568341, now seen corresponding path program 1 times
[2024-11-07 20:49:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:13,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621250582]
[2024-11-07 20:49:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:49:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:13,412 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-07 20:49:13,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:13,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621250582]
[2024-11-07 20:49:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621250582] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:13,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 20:49:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753953216]
[2024-11-07 20:49:13,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 20:49:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 20:49:13,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 20:49:13,415 INFO L87 Difference]: Start difference. First operand 247 states and 252 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-07 20:49:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:13,433 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions.
[2024-11-07 20:49:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 20:49:13,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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 57
[2024-11-07 20:49:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:13,435 INFO L225 Difference]: With dead ends: 249
[2024-11-07 20:49:13,435 INFO L226 Difference]: Without dead ends: 247
[2024-11-07 20:49:13,435 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-07 20:49:13,436 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:13,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:49:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2024-11-07 20:49:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247.
[2024-11-07 20:49:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 165 states have (on average 1.4787878787878788) internal successors, (244), 242 states have internal predecessors, (244), 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-07 20:49:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 250 transitions.
[2024-11-07 20:49:13,444 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 250 transitions. Word has length 57
[2024-11-07 20:49:13,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:13,445 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 250 transitions.
[2024-11-07 20:49:13,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-07 20:49:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 250 transitions.
[2024-11-07 20:49:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2024-11-07 20:49:13,447 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:13,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:13,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 20:49:13,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1007821026, now seen corresponding path program 1 times
[2024-11-07 20:49:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043159883]
[2024-11-07 20:49:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 20:49:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198705336]
[2024-11-07 20:49:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:49:13,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:49:13,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 20:49:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:13,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 20:49:13,526 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:49:13,595 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-07 20:49:13,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 20:49:13,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043159883]
[2024-11-07 20:49:13,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 20:49:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198705336]
[2024-11-07 20:49:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198705336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 20:49:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144079434]
[2024-11-07 20:49:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:13,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:13,598 INFO L87 Difference]: Start difference. First operand 247 states and 250 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-07 20:49:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:13,973 INFO L93 Difference]: Finished difference Result 426 states and 440 transitions.
[2024-11-07 20:49:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 20:49:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 62
[2024-11-07 20:49:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:13,975 INFO L225 Difference]: With dead ends: 426
[2024-11-07 20:49:13,975 INFO L226 Difference]: Without dead ends: 361
[2024-11-07 20:49:13,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-07 20:49:13,976 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 113 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:13,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 20:49:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states.
[2024-11-07 20:49:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 354.
[2024-11-07 20:49:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3518518518518519) internal successors, (365), 347 states have internal predecessors, (365), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 20:49:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 375 transitions.
[2024-11-07 20:49:13,987 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 375 transitions. Word has length 62
[2024-11-07 20:49:13,987 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 375 transitions.
[2024-11-07 20:49:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-07 20:49:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 375 transitions.
[2024-11-07 20:49:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2024-11-07 20:49:13,989 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:13,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:14,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 20:49:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:14,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -809386143, now seen corresponding path program 1 times
[2024-11-07 20:49:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177858890]
[2024-11-07 20:49:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:49:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:14,280 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-07 20:49:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177858890]
[2024-11-07 20:49:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177858890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:14,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 20:49:14,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144646975]
[2024-11-07 20:49:14,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:14,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:14,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:14,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:14,285 INFO L87 Difference]: Start difference. First operand 354 states and 375 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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-07 20:49:18,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:18,266 INFO L93 Difference]: Finished difference Result 355 states and 375 transitions.
[2024-11-07 20:49:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 20:49:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 69
[2024-11-07 20:49:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:18,268 INFO L225 Difference]: With dead ends: 355
[2024-11-07 20:49:18,268 INFO L226 Difference]: Without dead ends: 354
[2024-11-07 20:49:18,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:18,269 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 57 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:18,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 338 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time]
[2024-11-07 20:49:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2024-11-07 20:49:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354.
[2024-11-07 20:49:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.348148148148148) internal successors, (364), 347 states have internal predecessors, (364), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 20:49:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions.
[2024-11-07 20:49:18,279 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 69
[2024-11-07 20:49:18,281 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:18,281 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions.
[2024-11-07 20:49:18,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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-07 20:49:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions.
[2024-11-07 20:49:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2024-11-07 20:49:18,283 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:18,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:18,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 20:49:18,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash 678833514, now seen corresponding path program 1 times
[2024-11-07 20:49:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451054998]
[2024-11-07 20:49:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:49:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:18,365 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-07 20:49:18,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:18,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451054998]
[2024-11-07 20:49:18,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451054998] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:18,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:18,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 20:49:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189551617]
[2024-11-07 20:49:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:18,366 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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-07 20:49:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:18,646 INFO L93 Difference]: Finished difference Result 355 states and 374 transitions.
[2024-11-07 20:49:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 20:49:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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 70
[2024-11-07 20:49:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:18,648 INFO L225 Difference]: With dead ends: 355
[2024-11-07 20:49:18,648 INFO L226 Difference]: Without dead ends: 354
[2024-11-07 20:49:18,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:49:18,648 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:18,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 347 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:49:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2024-11-07 20:49:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354.
[2024-11-07 20:49:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 270 states have (on average 1.3444444444444446) internal successors, (363), 347 states have internal predecessors, (363), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 20:49:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 373 transitions.
[2024-11-07 20:49:18,655 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 373 transitions. Word has length 70
[2024-11-07 20:49:18,655 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:18,655 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 373 transitions.
[2024-11-07 20:49:18,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 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-07 20:49:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 373 transitions.
[2024-11-07 20:49:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2024-11-07 20:49:18,656 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:18,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 20:49:18,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:18,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1871737532, now seen corresponding path program 1 times
[2024-11-07 20:49:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944573807]
[2024-11-07 20:49:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:49:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:49:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944573807]
[2024-11-07 20:49:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944573807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:49:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:49:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 20:49:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40160509]
[2024-11-07 20:49:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:18,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:49:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:49:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:49:18,720 INFO L87 Difference]: Start difference. First operand 354 states and 373 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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-07 20:49:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:18,749 INFO L93 Difference]: Finished difference Result 484 states and 508 transitions.
[2024-11-07 20:49:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:49:18,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 73
[2024-11-07 20:49:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:18,751 INFO L225 Difference]: With dead ends: 484
[2024-11-07 20:49:18,755 INFO L226 Difference]: Without dead ends: 483
[2024-11-07 20:49:18,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:49:18,756 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 136 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:18,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 893 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:49:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states.
[2024-11-07 20:49:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 443.
[2024-11-07 20:49:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 435 states have internal predecessors, (483), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 20:49:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 497 transitions.
[2024-11-07 20:49:18,769 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 497 transitions. Word has length 73
[2024-11-07 20:49:18,769 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:18,769 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 497 transitions.
[2024-11-07 20:49:18,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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-07 20:49:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 497 transitions.
[2024-11-07 20:49:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-07 20:49:18,771 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:18,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:18,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 20:49:18,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:18,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1637859655, now seen corresponding path program 1 times
[2024-11-07 20:49:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975479599]
[2024-11-07 20:49:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 20:49:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629029763]
[2024-11-07 20:49:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:18,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:18,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:49:18,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:49:18,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 20:49:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:18,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 20:49:18,856 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:49:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:49:19,168 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:49:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:49:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975479599]
[2024-11-07 20:49:19,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 20:49:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629029763]
[2024-11-07 20:49:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629029763] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 20:49:19,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 20:49:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7
[2024-11-07 20:49:19,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574124593]
[2024-11-07 20:49:19,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 20:49:19,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 20:49:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 20:49:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:49:19,393 INFO L87 Difference]: Start difference. First operand 443 states and 497 transitions. Second operand has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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-07 20:49:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:20,418 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions.
[2024-11-07 20:49:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 20:49:20,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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) Word has length 113
[2024-11-07 20:49:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:20,420 INFO L225 Difference]: With dead ends: 467
[2024-11-07 20:49:20,420 INFO L226 Difference]: Without dead ends: 458
[2024-11-07 20:49:20,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110
[2024-11-07 20:49:20,421 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 418 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:20,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 265 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-07 20:49:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states.
[2024-11-07 20:49:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 447.
[2024-11-07 20:49:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 364 states have (on average 1.3186813186813187) internal successors, (480), 439 states have internal predecessors, (480), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 20:49:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 494 transitions.
[2024-11-07 20:49:20,430 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 494 transitions. Word has length 113
[2024-11-07 20:49:20,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:20,430 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 494 transitions.
[2024-11-07 20:49:20,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.857142857142858) internal successors, (216), 8 states have internal predecessors, (216), 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-07 20:49:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 494 transitions.
[2024-11-07 20:49:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-07 20:49:20,431 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:20,431 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:20,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 20:49:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:20,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2025106249, now seen corresponding path program 1 times
[2024-11-07 20:49:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385726802]
[2024-11-07 20:49:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 20:49:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943338683]
[2024-11-07 20:49:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:20,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:49:20,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:49:20,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-07 20:49:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:20,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 20:49:20,705 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:49:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:49:21,003 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:49:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:49:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385726802]
[2024-11-07 20:49:21,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 20:49:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943338683]
[2024-11-07 20:49:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943338683] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:49:21,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 20:49:21,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-11-07 20:49:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920121206]
[2024-11-07 20:49:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:49:21,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:49:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:49:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:49:21,347 INFO L87 Difference]: Start difference. First operand 447 states and 494 transitions. Second operand has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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-07 20:49:28,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:31,945 INFO L93 Difference]: Finished difference Result 447 states and 494 transitions.
[2024-11-07 20:49:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:49:31,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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 115
[2024-11-07 20:49:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:31,948 INFO L225 Difference]: With dead ends: 447
[2024-11-07 20:49:31,948 INFO L226 Difference]: Without dead ends: 445
[2024-11-07 20:49:31,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:49:31,949 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:31,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 411 Invalid, 1 Unknown, 0 Unchecked, 10.6s Time]
[2024-11-07 20:49:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states.
[2024-11-07 20:49:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445.
[2024-11-07 20:49:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 364 states have (on average 1.3021978021978022) internal successors, (474), 437 states have internal predecessors, (474), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 20:49:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 488 transitions.
[2024-11-07 20:49:31,961 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 488 transitions. Word has length 115
[2024-11-07 20:49:31,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:31,961 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 488 transitions.
[2024-11-07 20:49:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 4 states have internal predecessors, (110), 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-07 20:49:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 488 transitions.
[2024-11-07 20:49:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-07 20:49:31,963 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:31,963 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:31,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-07 20:49:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:32,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:32,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:32,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1716314514, now seen corresponding path program 1 times
[2024-11-07 20:49:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946488769]
[2024-11-07 20:49:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 20:49:32,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038745797]
[2024-11-07 20:49:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:32,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:32,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:49:32,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:49:32,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-07 20:49:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:32,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 20:49:32,261 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:49:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:49:32,532 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:49:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946488769]
[2024-11-07 20:49:32,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 20:49:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038745797]
[2024-11-07 20:49:32,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038745797] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:49:32,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-11-07 20:49:32,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4
[2024-11-07 20:49:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661566724]
[2024-11-07 20:49:32,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-11-07 20:49:32,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:49:32,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:49:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:49:32,724 INFO L87 Difference]: Start difference. First operand 445 states and 488 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-07 20:49:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:49:33,095 INFO L93 Difference]: Finished difference Result 452 states and 497 transitions.
[2024-11-07 20:49:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 20:49:33,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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) Word has length 122
[2024-11-07 20:49:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:49:33,097 INFO L225 Difference]: With dead ends: 452
[2024-11-07 20:49:33,098 INFO L226 Difference]: Without dead ends: 431
[2024-11-07 20:49:33,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2024-11-07 20:49:33,098 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:49:33,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:49:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2024-11-07 20:49:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417.
[2024-11-07 20:49:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 357 states have (on average 1.2128851540616246) internal successors, (433), 409 states have internal predecessors, (433), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 20:49:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 447 transitions.
[2024-11-07 20:49:33,110 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 447 transitions. Word has length 122
[2024-11-07 20:49:33,110 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:49:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 447 transitions.
[2024-11-07 20:49:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-07 20:49:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 447 transitions.
[2024-11-07 20:49:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2024-11-07 20:49:33,111 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:49:33,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:49:33,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-07 20:49:33,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-11-07 20:49:33,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:49:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:49:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1666142645, now seen corresponding path program 1 times
[2024-11-07 20:49:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:49:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28468450]
[2024-11-07 20:49:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:49:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 20:49:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986247402]
[2024-11-07 20:49:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:49:33,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:49:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:49:33,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:49:33,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-07 20:49:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:49:33,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 20:49:33,386 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:49:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:49:33,660 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:49:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:49:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:49:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28468450]
[2024-11-07 20:49:34,856 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-07 20:49:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986247402]
[2024-11-07 20:49:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986247402] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 20:49:34,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 20:49:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9
[2024-11-07 20:49:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829778070]
[2024-11-07 20:49:34,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 20:49:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 20:49:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:49:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 20:49:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2024-11-07 20:49:34,857 INFO L87 Difference]: Start difference. First operand 417 states and 447 transitions. Second operand has 10 states, 9 states have (on average 25.333333333333332) internal successors, (228), 10 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2024-11-07 20:49:39,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:43,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:47,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:51,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:55,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:49:59,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:03,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:07,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:11,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:14,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:15,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:20,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:24,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:28,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:33,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:37,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:41,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:45,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:49,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2024-11-07 20:50:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:50:51,374 INFO L93 Difference]: Finished difference Result 420 states and 450 transitions.
[2024-11-07 20:50:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 20:50:51,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 25.333333333333332) internal successors, (228), 10 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 123
[2024-11-07 20:50:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:50:51,377 INFO L225 Difference]: With dead ends: 420
[2024-11-07 20:50:51,377 INFO L226 Difference]: Without dead ends: 331
[2024-11-07 20:50:51,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2024-11-07 20:50:51,379 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 488 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 9 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.4s IncrementalHoareTripleChecker+Time
[2024-11-07 20:50:51,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 126 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 719 Invalid, 16 Unknown, 0 Unchecked, 76.4s Time]
[2024-11-07 20:50:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2024-11-07 20:50:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328.
[2024-11-07 20:50:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 271 states have (on average 1.2693726937269372) internal successors, (344), 321 states have internal predecessors, (344), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 20:50:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 354 transitions.
[2024-11-07 20:50:51,394 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 354 transitions. Word has length 123
[2024-11-07 20:50:51,395 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:50:51,395 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 354 transitions.
[2024-11-07 20:50:51,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 25.333333333333332) internal successors, (228), 10 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2024-11-07 20:50:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 354 transitions.
[2024-11-07 20:50:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-11-07 20:50:51,396 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:50:51,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:50:51,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-07 20:50:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-11-07 20:50:51,597 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:50:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:50:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1490519972, now seen corresponding path program 1 times
[2024-11-07 20:50:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:50:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604716713]
[2024-11-07 20:50:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:50:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:50:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:50:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 20:50:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:50:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:50:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604716713]
[2024-11-07 20:50:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604716713] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:50:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559156560]
[2024-11-07 20:50:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:50:51,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:50:51,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:50:51,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:50:51,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-07 20:50:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:51,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-07 20:50:51,778 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:50:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:50:51,885 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:50:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:50:52,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559156560] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 20:50:52,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 20:50:52,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2024-11-07 20:50:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278923824]
[2024-11-07 20:50:52,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 20:50:52,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:50:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:50:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:50:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:50:52,006 INFO L87 Difference]: Start difference. First operand 328 states and 354 transitions. Second operand has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 20:50:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:50:52,050 INFO L93 Difference]: Finished difference Result 642 states and 675 transitions.
[2024-11-07 20:50:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 20:50:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124
[2024-11-07 20:50:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:50:52,052 INFO L225 Difference]: With dead ends: 642
[2024-11-07 20:50:52,053 INFO L226 Difference]: Without dead ends: 641
[2024-11-07 20:50:52,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:50:52,054 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 295 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:50:52,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 756 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:50:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states.
[2024-11-07 20:50:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 450.
[2024-11-07 20:50:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 391 states have (on average 1.329923273657289) internal successors, (520), 441 states have internal predecessors, (520), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-07 20:50:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 534 transitions.
[2024-11-07 20:50:52,066 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 534 transitions. Word has length 124
[2024-11-07 20:50:52,067 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:50:52,067 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 534 transitions.
[2024-11-07 20:50:52,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.333333333333336) internal successors, (278), 7 states have internal predecessors, (278), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-07 20:50:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 534 transitions.
[2024-11-07 20:50:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2024-11-07 20:50:52,068 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:50:52,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:50:52,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-07 20:50:52,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-11-07 20:50:52,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] ===
[2024-11-07 20:50:52,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:50:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1928783128, now seen corresponding path program 1 times
[2024-11-07 20:50:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:50:52,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080744128]
[2024-11-07 20:50:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:50:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:50:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-07 20:50:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116
[2024-11-07 20:50:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 53 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:50:52,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:50:52,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080744128]
[2024-11-07 20:50:52,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080744128] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:50:52,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142663699]
[2024-11-07 20:50:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:50:52,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:50:52,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:50:52,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 20:50:52,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-07 20:50:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:50:52,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 20:50:52,446 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:50:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 57 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 20:50:52,520 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:50:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 53 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-07 20:50:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142663699] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 20:50:52,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 20:50:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6
[2024-11-07 20:50:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749629839]
[2024-11-07 20:50:52,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 20:50:52,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:50:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:50:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:50:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:50:52,599 INFO L87 Difference]: Start difference. First operand 450 states and 534 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 20:50:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:50:52,624 INFO L93 Difference]: Finished difference Result 454 states and 537 transitions.
[2024-11-07 20:50:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 20:50:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 128
[2024-11-07 20:50:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:50:52,625 INFO L225 Difference]: With dead ends: 454
[2024-11-07 20:50:52,625 INFO L226 Difference]: Without dead ends: 0
[2024-11-07 20:50:52,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2024-11-07 20:50:52,626 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:50:52,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:50:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-07 20:50:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-07 20:50:52,627 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-07 20:50:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-07 20:50:52,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128
[2024-11-07 20:50:52,627 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:50:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 20:50:52,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-07 20:50:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-07 20:50:52,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 104 remaining)
[2024-11-07 20:50:52,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 104 remaining)
[2024-11-07 20:50:52,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 104 remaining)
[2024-11-07 20:50:52,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 104 remaining)
[2024-11-07 20:50:52,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 104 remaining)
[2024-11-07 20:50:52,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 104 remaining)
[2024-11-07 20:50:52,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 104 remaining)
[2024-11-07 20:50:52,634 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 104 remaining)
[2024-11-07 20:50:52,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 104 remaining)
[2024-11-07 20:50:52,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 104 remaining)
[2024-11-07 20:50:52,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 104 remaining)
[2024-11-07 20:50:52,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 104 remaining)
[2024-11-07 20:50:52,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 104 remaining)
[2024-11-07 20:50:52,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 104 remaining)
[2024-11-07 20:50:52,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 104 remaining)
[2024-11-07 20:50:52,637 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 104 remaining)
[2024-11-07 20:50:52,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-07 20:50:52,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:50:52,839 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:50:52,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-07 20:50:52,900 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 20:50:52,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:50:52 BoogieIcfgContainer
[2024-11-07 20:50:52,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 20:50:52,914 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 20:50:52,914 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 20:50:52,915 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 20:50:52,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:49:11" (3/4) ...
[2024-11-07 20:50:52,916 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-07 20:50:52,920 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert
[2024-11-07 20:50:52,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-11-07 20:50:52,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-07 20:50:52,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-07 20:50:52,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-07 20:50:52,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 20:50:52,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-07 20:50:52,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 20:50:52,988 INFO L158 Benchmark]: Toolchain (without parser) took 101993.67ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 117.6MB in the beginning and 88.4MB in the end (delta: 29.2MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB.
[2024-11-07 20:50:52,988 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:50:52,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.20ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 106.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 20:50:52,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.18ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:50:52,989 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 20:50:52,989 INFO L158 Benchmark]: RCFGBuilder took 536.54ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 69.7MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-07 20:50:52,991 INFO L158 Benchmark]: TraceAbstraction took 101188.80ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.2MB in the beginning and 95.0MB in the end (delta: -25.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB.
[2024-11-07 20:50:52,991 INFO L158 Benchmark]: Witness Printer took 72.93ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 88.4MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:50:52,992 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.23ms. Allocated memory is still 117.4MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 136.20ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 106.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 34.18ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 20.67ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 536.54ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 69.7MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 101188.80ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 69.2MB in the beginning and 95.0MB in the end (delta: -25.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB.
* Witness Printer took 72.93ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 88.4MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB.
* 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: 28]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 28]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 29]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 34]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 34]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 35]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 35]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 36]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 39]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 40]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 40]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 40]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 40]: 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, 228 locations, 104 error locations. Started 1 CEGAR loops. OverallTime: 101.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 94.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 2269 SdHoareTripleChecker+Valid, 93.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2257 mSDsluCounter, 5528 SdHoareTripleChecker+Invalid, 93.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3268 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4219 IncrementalHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 2260 mSDtfsCounter, 4219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1511 GetRequests, 1439 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=16, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 308 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1967 NumberOfCodeBlocks, 1967 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2011 ConstructedInterpolants, 0 QuantifiedInterpolants, 12472 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1138 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 202/379 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
104 specifications checked. All of them hold
- InvariantResult [Line: 28]: Loop Invariant
Derived loop invariant: ((((((c == 0) && (y == 0)) && (counter == 0)) && (k <= 256)) && (x == 0)) || (((((((c <= 1) && (x == 1)) && (0 <= c)) && (y == 1)) && (1 <= k)) && (k <= 256)) && (counter == 1)))
- ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert
Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter))
RESULT: Ultimate proved your program to be correct!
[2024-11-07 20:50:53,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE