./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i --full-output --architecture 64bit
--------------------------------------------------------------------------------
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/termination-memory-alloca/b.13-alloca.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', 'e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524']
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/termination-memory-alloca/b.13-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 20:03:43,885 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 20:03:43,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf
[2024-11-07 20:03:43,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 20:03:43,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 20:03:43,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 20:03:43,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 20:03:43,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 20:03:43,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 20:03:43,979 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 20:03:43,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 20:03:43,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 20:03:43,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 20:03:43,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 20:03:43,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 20:03:43,988 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 20:03:43,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:03:43,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 20:03:43,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 20:03:43,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 20:03:43,990 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86ab88515027c2a8ad7a1a5d7cd34e589814e2f5fa9f70f400cd1ca5df85524
[2024-11-07 20:03:44,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 20:03:44,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 20:03:44,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 20:03:44,306 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 20:03:44,306 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 20:03:44,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i
[2024-11-07 20:03:45,447 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 20:03:45,784 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 20:03:45,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.13-alloca.i
[2024-11-07 20:03:45,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4137607a5/85b80237b9574a0c921edc1f9965393a/FLAG54abf196f
[2024-11-07 20:03:45,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4137607a5/85b80237b9574a0c921edc1f9965393a
[2024-11-07 20:03:45,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 20:03:45,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 20:03:45,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 20:03:45,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 20:03:45,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 20:03:45,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:03:45" (1/1) ...
[2024-11-07 20:03:45,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a53f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:45, skipping insertion in model container
[2024-11-07 20:03:45,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:03:45" (1/1) ...
[2024-11-07 20:03:45,843 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 20:03:46,027 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:03:46,034 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 20:03:46,065 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:03:46,092 INFO L204 MainTranslator]: Completed translation
[2024-11-07 20:03:46,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46 WrapperNode
[2024-11-07 20:03:46,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 20:03:46,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 20:03:46,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 20:03:46,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 20:03:46,098 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:03:46" (1/1) ...
[2024-11-07 20:03:46,105 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:03:46" (1/1) ...
[2024-11-07 20:03:46,117 INFO L138 Inliner]: procedures = 111, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103
[2024-11-07 20:03:46,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 20:03:46,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 20:03:46,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 20:03:46,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 20:03:46,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,139 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [1, 2, 2, 1].
[2024-11-07 20:03:46,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 20:03:46,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 20:03:46,161 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 20:03:46,161 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 20:03:46,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (1/1) ...
[2024-11-07 20:03:46,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:03:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:03:46,192 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:03:46,206 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:03:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-07 20:03:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 20:03:46,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 20:03:46,328 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 20:03:46,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 20:03:46,414 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live.
[2024-11-07 20:03:46,415 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 20:03:46,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 20:03:46,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 20:03:46,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:03:46 BoogieIcfgContainer
[2024-11-07 20:03:46,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 20:03:46,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 20:03:46,426 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 20:03:46,433 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 20:03:46,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:03:45" (1/3) ...
[2024-11-07 20:03:46,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c042497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:03:46, skipping insertion in model container
[2024-11-07 20:03:46,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:03:46" (2/3) ...
[2024-11-07 20:03:46,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c042497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:03:46, skipping insertion in model container
[2024-11-07 20:03:46,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:03:46" (3/3) ...
[2024-11-07 20:03:46,435 INFO L112 eAbstractionObserver]: Analyzing ICFG b.13-alloca.i
[2024-11-07 20:03:46,455 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 20:03:46,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-11-07 20:03:46,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 20:03:46,506 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;@2f0e8674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 20:03:46,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-11-07 20:03:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 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:03:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-07 20:03:46,512 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:46,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:46,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:46,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849165, now seen corresponding path program 1 times
[2024-11-07 20:03:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:46,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775876973]
[2024-11-07 20:03:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:46,872 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:03:46,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:46,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775876973]
[2024-11-07 20:03:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775876973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:03:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:03:46,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 20:03:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782946548]
[2024-11-07 20:03:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:03:46,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:03:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:03:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:03:46,889 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 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) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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:03:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:46,980 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions.
[2024-11-07 20:03:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 20:03:46,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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:03:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:46,987 INFO L225 Difference]: With dead ends: 40
[2024-11-07 20:03:46,987 INFO L226 Difference]: Without dead ends: 27
[2024-11-07 20:03:46,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-11-07 20:03:46,991 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:46,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 55 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:03:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2024-11-07 20:03:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23.
[2024-11-07 20:03:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.631578947368421) internal successors, (31), 22 states have internal predecessors, (31), 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:03:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions.
[2024-11-07 20:03:47,013 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 7
[2024-11-07 20:03:47,013 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:47,013 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions.
[2024-11-07 20:03:47,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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:03:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions.
[2024-11-07 20:03:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-07 20:03:47,013 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:47,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 20:03:47,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1806908747, now seen corresponding path program 1 times
[2024-11-07 20:03:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457075101]
[2024-11-07 20:03:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:47,132 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:03:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457075101]
[2024-11-07 20:03:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457075101] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:03:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:03:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 20:03:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761060832]
[2024-11-07 20:03:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:03:47,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:03:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:03:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:03:47,135 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:03:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:47,182 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions.
[2024-11-07 20:03:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:03:47,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:03:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:47,187 INFO L225 Difference]: With dead ends: 53
[2024-11-07 20:03:47,187 INFO L226 Difference]: Without dead ends: 32
[2024-11-07 20:03:47,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:03:47,188 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:47,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:03:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-07 20:03:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21.
[2024-11-07 20:03:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 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:03:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions.
[2024-11-07 20:03:47,195 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 7
[2024-11-07 20:03:47,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:47,195 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions.
[2024-11-07 20:03:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:03:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions.
[2024-11-07 20:03:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 20:03:47,196 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:47,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 20:03:47,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:47,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash 177749322, now seen corresponding path program 1 times
[2024-11-07 20:03:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268673652]
[2024-11-07 20:03:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:47,308 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:03:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268673652]
[2024-11-07 20:03:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268673652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:03:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:03:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 20:03:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823757812]
[2024-11-07 20:03:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:03:47,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:03:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:03:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:03:47,310 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:03:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:47,325 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions.
[2024-11-07 20:03:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 20:03:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 20:03:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:47,326 INFO L225 Difference]: With dead ends: 21
[2024-11-07 20:03:47,326 INFO L226 Difference]: Without dead ends: 20
[2024-11-07 20:03:47,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:03:47,327 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:47,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:03:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2024-11-07 20:03:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2024-11-07 20:03:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 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:03:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions.
[2024-11-07 20:03:47,332 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 8
[2024-11-07 20:03:47,336 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:47,336 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions.
[2024-11-07 20:03:47,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:03:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions.
[2024-11-07 20:03:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 20:03:47,337 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:47,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:47,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 20:03:47,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:47,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 177755312, now seen corresponding path program 1 times
[2024-11-07 20:03:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635681869]
[2024-11-07 20:03:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:47,456 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:03:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:47,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635681869]
[2024-11-07 20:03:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635681869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:03:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:03:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 20:03:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016051727]
[2024-11-07 20:03:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:03:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:03:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:03:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:03:47,457 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:03:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:47,494 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions.
[2024-11-07 20:03:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 20:03:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 20:03:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:47,496 INFO L225 Difference]: With dead ends: 37
[2024-11-07 20:03:47,496 INFO L226 Difference]: Without dead ends: 17
[2024-11-07 20:03:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:03:47,497 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:47,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:03:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2024-11-07 20:03:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2024-11-07 20:03:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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:03:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions.
[2024-11-07 20:03:47,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8
[2024-11-07 20:03:47,502 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions.
[2024-11-07 20:03:47,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:03:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions.
[2024-11-07 20:03:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 20:03:47,503 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:47,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 20:03:47,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 179602354, now seen corresponding path program 1 times
[2024-11-07 20:03:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618177852]
[2024-11-07 20:03:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:47,726 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:03:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618177852]
[2024-11-07 20:03:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618177852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:03:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:03:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 20:03:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52544140]
[2024-11-07 20:03:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:03:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:03:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:03:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:03:47,729 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:03:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:47,851 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions.
[2024-11-07 20:03:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 20:03:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 20:03:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:47,852 INFO L225 Difference]: With dead ends: 35
[2024-11-07 20:03:47,853 INFO L226 Difference]: Without dead ends: 34
[2024-11-07 20:03:47,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132
[2024-11-07 20:03:47,853 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:47,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 20:03:47,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2024-11-07 20:03:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26.
[2024-11-07 20:03:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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:03:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions.
[2024-11-07 20:03:47,859 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 8
[2024-11-07 20:03:47,859 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:47,859 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions.
[2024-11-07 20:03:47,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 20:03:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2024-11-07 20:03:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-07 20:03:47,859 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:47,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:47,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 20:03:47,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:47,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1272705742, now seen corresponding path program 1 times
[2024-11-07 20:03:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:47,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192395220]
[2024-11-07 20:03:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:47,928 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:03:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:47,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192395220]
[2024-11-07 20:03:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192395220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:03:47,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:03:47,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 20:03:47,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585494304]
[2024-11-07 20:03:47,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:03:47,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 20:03:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 20:03:47,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 20:03:47,930 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:47,947 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions.
[2024-11-07 20:03:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 20:03:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:47,947 INFO L225 Difference]: With dead ends: 26
[2024-11-07 20:03:47,947 INFO L226 Difference]: Without dead ends: 18
[2024-11-07 20:03:47,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:03:47,948 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:47,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:03:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2024-11-07 20:03:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2024-11-07 20:03:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:03:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions.
[2024-11-07 20:03:47,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9
[2024-11-07 20:03:47,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:47,950 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions.
[2024-11-07 20:03:47,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2024-11-07 20:03:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-07 20:03:47,950 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:03:47,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:47,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 20:03:47,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:03:47,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:03:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash 550336314, now seen corresponding path program 1 times
[2024-11-07 20:03:47,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:03:47,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709284129]
[2024-11-07 20:03:47,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:47,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:03:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 20:03:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:03:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709284129]
[2024-11-07 20:03:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709284129] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 20:03:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946570415]
[2024-11-07 20:03:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:03:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:03:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:03:48,060 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:03:48,062 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:03:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:03:48,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-07 20:03:48,135 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 20:03:48,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1
[2024-11-07 20:03:48,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-07 20:03:48,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-11-07 20:03:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 20:03:48,217 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 20:03:48,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15
[2024-11-07 20:03:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-11-07 20:03:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946570415] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 20:03:48,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 20:03:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5
[2024-11-07 20:03:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759783252]
[2024-11-07 20:03:48,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 20:03:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:03:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:03:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:03:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:03:48,257 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:03:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:03:48,301 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions.
[2024-11-07 20:03:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 20:03:48,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 14
[2024-11-07 20:03:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:03:48,301 INFO L225 Difference]: With dead ends: 21
[2024-11-07 20:03:48,301 INFO L226 Difference]: Without dead ends: 0
[2024-11-07 20:03:48,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-11-07 20:03:48,302 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 20:03:48,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 20:03:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-07 20:03:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-07 20:03:48,303 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:03:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-07 20:03:48,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14
[2024-11-07 20:03:48,303 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:03:48,303 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 20:03:48,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:03:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-07 20:03:48,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-07 20:03:48,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining)
[2024-11-07 20:03:48,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining)
[2024-11-07 20:03:48,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining)
[2024-11-07 20:03:48,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining)
[2024-11-07 20:03:48,317 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:03:48,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 20:03:48,512 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:03:48,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-07 20:03:48,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 20:03:48,561 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1
[2024-11-07 20:03:48,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
[2024-11-07 20:03:48,562 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-07 20:03:48,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3
[2024-11-07 20:03:48,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
[2024-11-07 20:03:48,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~z_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-07 20:03:48,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2
[2024-11-07 20:03:48,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
[2024-11-07 20:03:48,563 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y_ref~0!base,<LOCAL,test_fun>]]]
[2024-11-07 20:03:48,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:03:48 BoogieIcfgContainer
[2024-11-07 20:03:48,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 20:03:48,564 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 20:03:48,565 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 20:03:48,565 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 20:03:48,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:03:46" (3/4) ...
[2024-11-07 20:03:48,566 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-07 20:03:48,571 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-11-07 20:03:48,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-07 20:03:48,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2024-11-07 20:03:48,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-07 20:03:48,637 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 20:03:48,637 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-07 20:03:48,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 20:03:48,638 INFO L158 Benchmark]: Toolchain (without parser) took 2825.40ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 84.6MB in the beginning and 132.5MB in the end (delta: -47.9MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB.
[2024-11-07 20:03:48,639 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:03:48,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.44ms. Allocated memory is still 109.1MB. Free memory was 84.5MB in the beginning and 68.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 20:03:48,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.93ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 66.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:03:48,640 INFO L158 Benchmark]: Boogie Preprocessor took 42.32ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 65.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:03:48,640 INFO L158 Benchmark]: RCFGBuilder took 263.72ms. Allocated memory is still 109.1MB. Free memory was 65.1MB in the beginning and 52.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 20:03:48,640 INFO L158 Benchmark]: TraceAbstraction took 2138.71ms. Allocated memory is still 109.1MB. Free memory was 52.0MB in the beginning and 36.5MB in the end (delta: 15.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB.
[2024-11-07 20:03:48,641 INFO L158 Benchmark]: Witness Printer took 72.91ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 36.5MB in the beginning and 132.5MB in the end (delta: -96.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 20:03:48,641 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.16ms. Allocated memory is still 83.9MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 279.44ms. Allocated memory is still 109.1MB. Free memory was 84.5MB in the beginning and 68.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 23.93ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 66.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 42.32ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 65.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 263.72ms. Allocated memory is still 109.1MB. Free memory was 65.1MB in the beginning and 52.6MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 2138.71ms. Allocated memory is still 109.1MB. Free memory was 52.0MB in the beginning and 36.5MB in the end (delta: 15.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB.
* Witness Printer took 72.91ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 36.5MB in the beginning and 132.5MB in the end (delta: -96.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#1
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x_ref~0!base,<LOCAL,test_fun>]]]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#3
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~z_ref~0!base,<LOCAL,test_fun>]]]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Unknown variable: #memory_int#2
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~y_ref~0!base,<LOCAL,test_fun>]]]
* 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: 559]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 559]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 562]: integer overflow can never occur
For all program executions holds that integer overflow can never occur at this location
- PositiveResult [Line: 562]: 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 1 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 79 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 9 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
4 specifications checked. All of them hold
- InvariantResult [Line: 557]: Loop Invariant
Derived loop invariant: null
RESULT: Ultimate proved your program to be correct!
[2024-11-07 20:03:48,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE