./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902']
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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:25:09,550 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:25:09,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 08:25:09,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:25:09,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:25:09,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:25:09,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:25:09,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:25:09,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:25:09,698 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:25:09,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:25:09,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:25:09,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:25:09,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:25:09,699 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:25:09,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:25:09,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:25:09,700 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:25:09,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:25:09,701 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:25:09,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:25:09,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:25:09,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:25:09,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:25:09,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:25:09,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:25:09,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:25:09,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:25:09,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:25:09,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:25:09,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:25:09,703 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 ! call(reach_error())) )
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 -> d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902
[2024-11-07 08:25:09,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:25:09,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:25:09,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:25:09,957 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:25:09,958 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:25:09,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i
[2024-11-07 08:25:11,272 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:25:11,559 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:25:11,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i
[2024-11-07 08:25:11,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0319cb27f/c65fd304999a4d80a288cada815de95e/FLAG7a4c5f656
[2024-11-07 08:25:11,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0319cb27f/c65fd304999a4d80a288cada815de95e
[2024-11-07 08:25:11,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:25:11,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:25:11,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:25:11,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:25:11,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:25:11,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70817d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11, skipping insertion in model container
[2024-11-07 08:25:11,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,625 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:25:11,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928]
[2024-11-07 08:25:11,821 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:25:11,833 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:25:11,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928]
[2024-11-07 08:25:11,873 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:25:11,893 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:25:11,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11 WrapperNode
[2024-11-07 08:25:11,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:25:11,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:25:11,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:25:11,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:25:11,902 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:25:11" (1/1) ...
[2024-11-07 08:25:11,913 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:25:11" (1/1) ...
[2024-11-07 08:25:11,948 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148
[2024-11-07 08:25:11,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:25:11,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:25:11,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:25:11,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:25:11,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,974 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 08:25:11,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:25:11,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:25:11,992 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:25:11,993 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:25:11,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (1/1) ...
[2024-11-07 08:25:11,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:25:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:25:12,026 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 08:25:12,033 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 08:25:12,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:25:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:25:12,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:25:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:25:12,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:25:12,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:25:12,124 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:25:12,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:25:12,381 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live.
[2024-11-07 08:25:12,382 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:25:12,392 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:25:12,392 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:25:12,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:12 BoogieIcfgContainer
[2024-11-07 08:25:12,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:25:12,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:25:12,397 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:25:12,402 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:25:12,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:25:11" (1/3) ...
[2024-11-07 08:25:12,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c55244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:12, skipping insertion in model container
[2024-11-07 08:25:12,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:11" (2/3) ...
[2024-11-07 08:25:12,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c55244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:12, skipping insertion in model container
[2024-11-07 08:25:12,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:12" (3/3) ...
[2024-11-07 08:25:12,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i
[2024-11-07 08:25:12,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:25:12,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:25:12,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:25:12,490 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;@16dfb5df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:25:12,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:25:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-07 08:25:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-07 08:25:12,505 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:12,506 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:12,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:12,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -292747002, now seen corresponding path program 1 times
[2024-11-07 08:25:12,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:12,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085777894]
[2024-11-07 08:25:12,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:12,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:12,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085777894]
[2024-11-07 08:25:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085777894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:25:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136767006]
[2024-11-07 08:25:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:12,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:25:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:25:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:25:12,947 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-07 08:25:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:12,971 INFO L93 Difference]: Finished difference Result 127 states and 207 transitions.
[2024-11-07 08:25:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:25:12,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108
[2024-11-07 08:25:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:12,980 INFO L225 Difference]: With dead ends: 127
[2024-11-07 08:25:12,981 INFO L226 Difference]: Without dead ends: 60
[2024-11-07 08:25:12,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 08:25:12,990 INFO L432 NwaCegarLoop]: 91 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, 91 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 08:25:12,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:25:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2024-11-07 08:25:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2024-11-07 08:25:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-07 08:25:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions.
[2024-11-07 08:25:13,034 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 108
[2024-11-07 08:25:13,034 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:13,034 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions.
[2024-11-07 08:25:13,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-07 08:25:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions.
[2024-11-07 08:25:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-07 08:25:13,037 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:13,037 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:13,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:25:13,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1158582018, now seen corresponding path program 1 times
[2024-11-07 08:25:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821538049]
[2024-11-07 08:25:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821538049]
[2024-11-07 08:25:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821538049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:13,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:13,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:25:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032320847]
[2024-11-07 08:25:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 08:25:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:13,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 08:25:13,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 08:25:13,588 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:13,665 INFO L93 Difference]: Finished difference Result 119 states and 174 transitions.
[2024-11-07 08:25:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 08:25:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108
[2024-11-07 08:25:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:13,671 INFO L225 Difference]: With dead ends: 119
[2024-11-07 08:25:13,671 INFO L226 Difference]: Without dead ends: 62
[2024-11-07 08:25:13,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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 08:25:13,674 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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.1s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:13,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 08:25:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states.
[2024-11-07 08:25:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62.
[2024-11-07 08:25:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-07 08:25:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions.
[2024-11-07 08:25:13,686 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 108
[2024-11-07 08:25:13,687 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:13,687 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions.
[2024-11-07 08:25:13,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions.
[2024-11-07 08:25:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-07 08:25:13,689 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:13,689 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:13,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:25:13,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:13,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1597578460, now seen corresponding path program 1 times
[2024-11-07 08:25:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:13,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610707738]
[2024-11-07 08:25:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610707738]
[2024-11-07 08:25:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610707738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 08:25:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683116830]
[2024-11-07 08:25:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:25:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:14,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:25:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:25:14,010 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:14,174 INFO L93 Difference]: Finished difference Result 195 states and 280 transitions.
[2024-11-07 08:25:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 08:25:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109
[2024-11-07 08:25:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:14,178 INFO L225 Difference]: With dead ends: 195
[2024-11-07 08:25:14,179 INFO L226 Difference]: Without dead ends: 136
[2024-11-07 08:25:14,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:25:14,181 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 91 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:14,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 320 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 08:25:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2024-11-07 08:25:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119.
[2024-11-07 08:25:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-07 08:25:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions.
[2024-11-07 08:25:14,212 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 109
[2024-11-07 08:25:14,213 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:14,213 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions.
[2024-11-07 08:25:14,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions.
[2024-11-07 08:25:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-07 08:25:14,216 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:14,216 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:14,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:25:14,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash 586461210, now seen corresponding path program 1 times
[2024-11-07 08:25:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:14,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329810459]
[2024-11-07 08:25:14,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:14,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-07 08:25:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329810459]
[2024-11-07 08:25:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329810459] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 08:25:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177571322]
[2024-11-07 08:25:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:14,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:25:14,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:25:14,928 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 08:25:14,932 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 08:25:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:15,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-07 08:25:15,071 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:25:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 136 proven. 48 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked.
[2024-11-07 08:25:15,200 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:25:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-07 08:25:15,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177571322] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:25:15,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 08:25:15,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9
[2024-11-07 08:25:15,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490404563]
[2024-11-07 08:25:15,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:25:15,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 08:25:15,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:15,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 08:25:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2024-11-07 08:25:15,392 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-07 08:25:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:15,811 INFO L93 Difference]: Finished difference Result 326 states and 462 transitions.
[2024-11-07 08:25:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 08:25:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 109
[2024-11-07 08:25:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:15,816 INFO L225 Difference]: With dead ends: 326
[2024-11-07 08:25:15,816 INFO L226 Difference]: Without dead ends: 210
[2024-11-07 08:25:15,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342
[2024-11-07 08:25:15,820 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 253 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:15,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 248 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:25:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2024-11-07 08:25:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195.
[2024-11-07 08:25:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48)
[2024-11-07 08:25:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions.
[2024-11-07 08:25:15,866 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 109
[2024-11-07 08:25:15,866 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions.
[2024-11-07 08:25:15,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)
[2024-11-07 08:25:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions.
[2024-11-07 08:25:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-07 08:25:15,868 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:15,868 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:15,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-07 08:25:16,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:25:16,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:16,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1552121946, now seen corresponding path program 1 times
[2024-11-07 08:25:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:16,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180775517]
[2024-11-07 08:25:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180775517]
[2024-11-07 08:25:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180775517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:16,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:16,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:25:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939851565]
[2024-11-07 08:25:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:16,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 08:25:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 08:25:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 08:25:16,252 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:16,318 INFO L93 Difference]: Finished difference Result 407 states and 569 transitions.
[2024-11-07 08:25:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 08:25:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109
[2024-11-07 08:25:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:16,324 INFO L225 Difference]: With dead ends: 407
[2024-11-07 08:25:16,324 INFO L226 Difference]: Without dead ends: 215
[2024-11-07 08:25:16,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 08:25:16,328 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 78 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:16,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 254 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:25:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2024-11-07 08:25:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195.
[2024-11-07 08:25:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 140 states have (on average 1.25) internal successors, (175), 140 states have internal predecessors, (175), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48)
[2024-11-07 08:25:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 271 transitions.
[2024-11-07 08:25:16,359 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 271 transitions. Word has length 109
[2024-11-07 08:25:16,359 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 271 transitions.
[2024-11-07 08:25:16,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 271 transitions.
[2024-11-07 08:25:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-07 08:25:16,361 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:16,361 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:16,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 08:25:16,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash 115689461, now seen corresponding path program 1 times
[2024-11-07 08:25:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720452153]
[2024-11-07 08:25:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:19,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:19,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720452153]
[2024-11-07 08:25:19,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720452153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-07 08:25:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706120014]
[2024-11-07 08:25:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:19,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 08:25:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 08:25:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2024-11-07 08:25:19,402 INFO L87 Difference]: Start difference. First operand 195 states and 271 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:20,866 INFO L93 Difference]: Finished difference Result 550 states and 737 transitions.
[2024-11-07 08:25:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 08:25:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111
[2024-11-07 08:25:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:20,871 INFO L225 Difference]: With dead ends: 550
[2024-11-07 08:25:20,871 INFO L226 Difference]: Without dead ends: 358
[2024-11-07 08:25:20,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756
[2024-11-07 08:25:20,874 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 291 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:20,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 662 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-07 08:25:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2024-11-07 08:25:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 224.
[2024-11-07 08:25:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 162 states have (on average 1.228395061728395) internal successors, (199), 163 states have internal predecessors, (199), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54)
[2024-11-07 08:25:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 307 transitions.
[2024-11-07 08:25:20,923 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 307 transitions. Word has length 111
[2024-11-07 08:25:20,923 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 307 transitions.
[2024-11-07 08:25:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 307 transitions.
[2024-11-07 08:25:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-07 08:25:20,925 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:20,925 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 08:25:20,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -104611325, now seen corresponding path program 1 times
[2024-11-07 08:25:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267908916]
[2024-11-07 08:25:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267908916]
[2024-11-07 08:25:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267908916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:21,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:25:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676616435]
[2024-11-07 08:25:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:21,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 08:25:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 08:25:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 08:25:21,140 INFO L87 Difference]: Start difference. First operand 224 states and 307 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:21,298 INFO L93 Difference]: Finished difference Result 618 states and 845 transitions.
[2024-11-07 08:25:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 08:25:21,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111
[2024-11-07 08:25:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:21,302 INFO L225 Difference]: With dead ends: 618
[2024-11-07 08:25:21,303 INFO L226 Difference]: Without dead ends: 409
[2024-11-07 08:25:21,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 08:25:21,304 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 115 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:21,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 210 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 08:25:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states.
[2024-11-07 08:25:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301.
[2024-11-07 08:25:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 220 states have (on average 1.190909090909091) internal successors, (262), 222 states have internal predecessors, (262), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70)
[2024-11-07 08:25:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions.
[2024-11-07 08:25:21,353 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 111
[2024-11-07 08:25:21,354 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions.
[2024-11-07 08:25:21,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions.
[2024-11-07 08:25:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-07 08:25:21,355 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:21,356 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 08:25:21,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:21,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1850381496, now seen corresponding path program 1 times
[2024-11-07 08:25:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029921363]
[2024-11-07 08:25:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:21,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:21,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029921363]
[2024-11-07 08:25:21,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029921363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:21,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:21,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:25:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653342026]
[2024-11-07 08:25:21,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:21,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:25:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:25:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:25:21,432 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:21,513 INFO L93 Difference]: Finished difference Result 737 states and 984 transitions.
[2024-11-07 08:25:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:25:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112
[2024-11-07 08:25:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:21,519 INFO L225 Difference]: With dead ends: 737
[2024-11-07 08:25:21,519 INFO L226 Difference]: Without dead ends: 451
[2024-11-07 08:25:21,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 08:25:21,521 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:21,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 155 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:25:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states.
[2024-11-07 08:25:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 295.
[2024-11-07 08:25:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 214 states have (on average 1.1542056074766356) internal successors, (247), 216 states have internal predecessors, (247), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70)
[2024-11-07 08:25:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 387 transitions.
[2024-11-07 08:25:21,589 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 387 transitions. Word has length 112
[2024-11-07 08:25:21,589 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:21,589 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 387 transitions.
[2024-11-07 08:25:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 387 transitions.
[2024-11-07 08:25:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-07 08:25:21,590 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:21,590 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 08:25:21,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash -258877806, now seen corresponding path program 1 times
[2024-11-07 08:25:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568196224]
[2024-11-07 08:25:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:21,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:21,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568196224]
[2024-11-07 08:25:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568196224] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:21,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:21,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 08:25:21,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842857078]
[2024-11-07 08:25:21,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:21,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:25:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:25:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:25:21,754 INFO L87 Difference]: Start difference. First operand 295 states and 387 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:21,904 INFO L93 Difference]: Finished difference Result 565 states and 750 transitions.
[2024-11-07 08:25:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 08:25:21,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112
[2024-11-07 08:25:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:21,910 INFO L225 Difference]: With dead ends: 565
[2024-11-07 08:25:21,910 INFO L226 Difference]: Without dead ends: 430
[2024-11-07 08:25:21,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 08:25:21,911 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 67 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:21,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 229 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 08:25:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2024-11-07 08:25:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 295.
[2024-11-07 08:25:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 214 states have (on average 1.1308411214953271) internal successors, (242), 216 states have internal predecessors, (242), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70)
[2024-11-07 08:25:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 382 transitions.
[2024-11-07 08:25:21,975 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 382 transitions. Word has length 112
[2024-11-07 08:25:21,975 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:21,975 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 382 transitions.
[2024-11-07 08:25:21,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 382 transitions.
[2024-11-07 08:25:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-07 08:25:21,977 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:21,977 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:21,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 08:25:21,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:21,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash 372474061, now seen corresponding path program 1 times
[2024-11-07 08:25:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:21,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762986671]
[2024-11-07 08:25:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:25:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:25:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:25:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-07 08:25:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-07 08:25:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-07 08:25:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-07 08:25:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 08:25:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 08:25:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 08:25:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 08:25:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 08:25:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-07 08:25:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 08:25:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84
[2024-11-07 08:25:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89
[2024-11-07 08:25:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:25:24,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762986671]
[2024-11-07 08:25:24,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762986671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:24,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:24,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-11-07 08:25:24,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375917808]
[2024-11-07 08:25:24,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:24,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-07 08:25:24,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:25:24,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-07 08:25:24,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240
[2024-11-07 08:25:24,875 INFO L87 Difference]: Start difference. First operand 295 states and 382 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:26,115 INFO L93 Difference]: Finished difference Result 648 states and 824 transitions.
[2024-11-07 08:25:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 08:25:26,115 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112
[2024-11-07 08:25:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:26,119 INFO L225 Difference]: With dead ends: 648
[2024-11-07 08:25:26,120 INFO L226 Difference]: Without dead ends: 368
[2024-11-07 08:25:26,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812
[2024-11-07 08:25:26,122 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 156 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:26,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 600 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 08:25:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states.
[2024-11-07 08:25:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 287.
[2024-11-07 08:25:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 206 states have (on average 1.1262135922330097) internal successors, (232), 208 states have internal predecessors, (232), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70)
[2024-11-07 08:25:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 372 transitions.
[2024-11-07 08:25:26,175 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 372 transitions. Word has length 112
[2024-11-07 08:25:26,176 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:26,176 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 372 transitions.
[2024-11-07 08:25:26,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 372 transitions.
[2024-11-07 08:25:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-11-07 08:25:26,177 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:26,177 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 08:25:26,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -576362040, now seen corresponding path program 1 times
[2024-11-07 08:25:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:25:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585606131]
[2024-11-07 08:25:26,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:26,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:25:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:25:26,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:25:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:25:26,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:25:26,329 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:25:26,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:25:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 08:25:26,335 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 08:25:26,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:25:26,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:25:26 BoogieIcfgContainer
[2024-11-07 08:25:26,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:25:26,427 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:25:26,427 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:25:26,427 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:25:26,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:12" (3/4) ...
[2024-11-07 08:25:26,444 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:25:26,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:25:26,447 INFO L158 Benchmark]: Toolchain (without parser) took 14849.59ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 85.5MB in the beginning and 237.6MB in the end (delta: -152.1MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB.
[2024-11-07 08:25:26,447 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:25:26,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.10ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 72.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:25:26,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.90ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 70.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:25:26,448 INFO L158 Benchmark]: Boogie Preprocessor took 41.85ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:25:26,448 INFO L158 Benchmark]: RCFGBuilder took 400.55ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 51.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:25:26,448 INFO L158 Benchmark]: TraceAbstraction took 14028.95ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 51.3MB in the beginning and 90.0MB in the end (delta: -38.8MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB.
[2024-11-07 08:25:26,449 INFO L158 Benchmark]: Witness Printer took 18.67ms. Allocated memory is still 268.4MB. Free memory was 90.0MB in the beginning and 237.6MB in the end (delta: -147.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB.
[2024-11-07 08:25:26,451 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.25ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 297.10ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 72.5MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 52.90ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 70.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 41.85ms. Allocated memory is still 109.1MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 400.55ms. Allocated memory is still 109.1MB. Free memory was 68.3MB in the beginning and 51.9MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 14028.95ms. Allocated memory was 109.1MB in the beginning and 268.4MB in the end (delta: 159.4MB). Free memory was 51.3MB in the beginning and 90.0MB in the end (delta: -38.8MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB.
* Witness Printer took 18.67ms. Allocated memory is still 268.4MB. Free memory was 90.0MB in the beginning and 237.6MB in the end (delta: -147.6MB). Peak memory consumption was 8.7MB. 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
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] double var_1_1 = 9999.5;
[L23] unsigned char var_1_2 = 1;
[L24] double var_1_3 = 4.5;
[L25] double var_1_4 = 2.5;
[L26] double var_1_5 = 0.0;
[L27] double var_1_6 = 999999999999.3;
[L28] signed char var_1_7 = -128;
[L29] signed char var_1_11 = -64;
[L30] signed char var_1_12 = 5;
[L31] signed char var_1_13 = 50;
[L32] unsigned char var_1_14 = 0;
[L33] unsigned char var_1_15 = 0;
[L34] unsigned char var_1_16 = 0;
[L35] unsigned char var_1_17 = 0;
[L36] signed char last_1_var_1_7 = -128;
VAL [isInitial=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L107] isInitial = 1
[L108] FCALL initially()
[L109] int k_loop;
[L110] k_loop = 0
VAL [isInitial=1, k_loop=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L110] COND TRUE k_loop < 1
[L111] CALL updateLastVariables()
[L100] last_1_var_1_7 = var_1_7
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L111] RET updateLastVariables()
[L112] CALL updateVariables()
[L72] var_1_2 = __VERIFIER_nondet_uchar()
[L73] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L73] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L74] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L74] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L75] var_1_3 = __VERIFIER_nondet_double()
[L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L77] var_1_4 = __VERIFIER_nondet_double()
[L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128]
[L79] var_1_5 = __VERIFIER_nondet_double()
[L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128]
[L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_6=9999999999993/10, var_1_7=-128]
[L81] var_1_6 = __VERIFIER_nondet_double()
[L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L83] var_1_11 = __VERIFIER_nondet_char()
[L84] CALL assume_abort_if_not(var_1_11 >= -127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L84] RET assume_abort_if_not(var_1_11 >= -127)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L85] CALL assume_abort_if_not(var_1_11 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L85] RET assume_abort_if_not(var_1_11 <= 126)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L86] var_1_13 = __VERIFIER_nondet_char()
[L87] CALL assume_abort_if_not(var_1_13 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L87] RET assume_abort_if_not(var_1_13 >= -1)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L88] CALL assume_abort_if_not(var_1_13 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L88] RET assume_abort_if_not(var_1_13 <= 126)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L89] var_1_15 = __VERIFIER_nondet_uchar()
[L90] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L90] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L91] CALL assume_abort_if_not(var_1_15 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L91] RET assume_abort_if_not(var_1_15 <= 1)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L92] var_1_16 = __VERIFIER_nondet_uchar()
[L93] CALL assume_abort_if_not(var_1_16 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L93] RET assume_abort_if_not(var_1_16 >= 0)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L94] CALL assume_abort_if_not(var_1_16 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L94] RET assume_abort_if_not(var_1_16 <= 0)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L95] var_1_17 = __VERIFIER_nondet_uchar()
[L96] CALL assume_abort_if_not(var_1_17 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L96] RET assume_abort_if_not(var_1_17 >= 1)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L97] CALL assume_abort_if_not(var_1_17 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L97] RET assume_abort_if_not(var_1_17 <= 1)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L112] RET updateVariables()
[L113] CALL step()
[L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7;
VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=-25, var_1_12=5, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1)
[L44] var_1_12 = var_1_11
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L46] unsigned char stepLocal_3 = var_1_2;
[L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12));
VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_2=-25, stepLocal_3=-256, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L48] COND TRUE stepLocal_3 || var_1_15
VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_2=-25, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L49] COND TRUE stepLocal_2 <= var_1_12
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L50] COND FALSE !(\read(var_1_2))
[L53] var_1_14 = var_1_17
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L59] EXPR var_1_12 ^ var_1_12
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12;
[L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-128]
[L61] COND TRUE \read(var_1_14)
[L62] var_1_7 = var_1_11
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=19999/2, var_1_2=-256, var_1_7=-25]
[L67] COND TRUE \read(var_1_14)
[L68] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6)))))
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-25]
[L113] RET step()
[L114] CALL, EXPR property()
[L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-25]
[L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16)))
;
[L114] RET, EXPR property()
[L114] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-25]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=-1, var_1_14=-255, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_1=1000000000004, var_1_2=-256, var_1_3=1000000000004, var_1_7=-25]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1116 mSDsluCounter, 2985 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2043 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 942 mSDtfsCounter, 1590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 578 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 666 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1307 ConstructedInterpolants, 0 QuantifiedInterpolants, 3509 SizeOfPredicates, 4 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 5700/5760 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
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-07 08:25:26,484 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
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:25:28,705 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:25:28,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 08:25:28,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:25:28,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:25:28,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:25:28,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:25:28,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:25:28,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:25:28,865 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:25:28,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:25:28,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:25:28,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:25:28,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:25:28,867 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:25:28,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:25:28,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:25:28,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:25:28,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:25:28,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:25:28,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:25:28,869 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 ! call(reach_error())) )
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 -> d61c0dafed482002b011add1f5476de4fd21f0cbe5ef1ca0c06dd442b2a70902
[2024-11-07 08:25:29,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:25:29,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:25:29,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:25:29,150 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:25:29,151 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:25:29,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i
[2024-11-07 08:25:30,507 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:25:30,756 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:25:30,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i
[2024-11-07 08:25:30,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07b31875f/682480a740044c889af248713da2bb8c/FLAGbedc4d5ce
[2024-11-07 08:25:31,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07b31875f/682480a740044c889af248713da2bb8c
[2024-11-07 08:25:31,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:25:31,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:25:31,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:25:31,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:25:31,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:25:31,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52658556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31, skipping insertion in model container
[2024-11-07 08:25:31,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,110 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:25:31,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928]
[2024-11-07 08:25:31,306 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:25:31,321 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:25:31,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i[915,928]
[2024-11-07 08:25:31,361 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:25:31,377 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:25:31,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31 WrapperNode
[2024-11-07 08:25:31,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:25:31,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:25:31,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:25:31,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:25:31,386 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:25:31" (1/1) ...
[2024-11-07 08:25:31,397 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:25:31" (1/1) ...
[2024-11-07 08:25:31,424 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120
[2024-11-07 08:25:31,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:25:31,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:25:31,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:25:31,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:25:31,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,452 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 08:25:31,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:25:31,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:25:31,471 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:25:31,471 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:25:31,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (1/1) ...
[2024-11-07 08:25:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:25:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:25:31,514 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 08:25:31,520 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 08:25:31,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:25:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:25:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:25:31,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:25:31,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:25:31,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:25:31,627 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:25:31,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:25:32,882 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live.
[2024-11-07 08:25:32,883 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:25:32,891 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:25:32,891 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:25:32,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:32 BoogieIcfgContainer
[2024-11-07 08:25:32,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:25:32,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:25:32,894 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:25:32,899 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:25:32,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:25:31" (1/3) ...
[2024-11-07 08:25:32,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4459e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:32, skipping insertion in model container
[2024-11-07 08:25:32,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:31" (2/3) ...
[2024-11-07 08:25:32,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4459e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:32, skipping insertion in model container
[2024-11-07 08:25:32,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:32" (3/3) ...
[2024-11-07 08:25:32,902 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i
[2024-11-07 08:25:32,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:25:32,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:25:32,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:25:32,997 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;@11e3fddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:25:32,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:25:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-07 08:25:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-07 08:25:33,010 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:33,011 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:33,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1223975403, now seen corresponding path program 1 times
[2024-11-07 08:25:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:25:33,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466245636]
[2024-11-07 08:25:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:25:33,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:25:33,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-07 08:25:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:33,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:25:33,296 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:25:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked.
[2024-11-07 08:25:33,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:25:33,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:25:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466245636]
[2024-11-07 08:25:33,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466245636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:33,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:33,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:25:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108153815]
[2024-11-07 08:25:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:33,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:25:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:25:33,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:25:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:25:33,357 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-07 08:25:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:33,374 INFO L93 Difference]: Finished difference Result 107 states and 173 transitions.
[2024-11-07 08:25:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:25:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105
[2024-11-07 08:25:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:33,381 INFO L225 Difference]: With dead ends: 107
[2024-11-07 08:25:33,381 INFO L226 Difference]: Without dead ends: 51
[2024-11-07 08:25:33,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 08:25:33,386 INFO L432 NwaCegarLoop]: 77 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, 77 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 08:25:33,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:25:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-07 08:25:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-07 08:25:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-07 08:25:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions.
[2024-11-07 08:25:33,418 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 105
[2024-11-07 08:25:33,418 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions.
[2024-11-07 08:25:33,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-07 08:25:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions.
[2024-11-07 08:25:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-07 08:25:33,421 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:33,421 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:33,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2024-11-07 08:25:33,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:33,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:33,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1020378355, now seen corresponding path program 1 times
[2024-11-07 08:25:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:25:33,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755024819]
[2024-11-07 08:25:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:33,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:25:33,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:25:33,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 08:25:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:33,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 08:25:33,906 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:25:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:34,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:25:34,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:25:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755024819]
[2024-11-07 08:25:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755024819] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:34,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:25:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117173919]
[2024-11-07 08:25:34,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:25:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:25:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:25:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:25:34,400 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:36,526 INFO L93 Difference]: Finished difference Result 156 states and 223 transitions.
[2024-11-07 08:25:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 08:25:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105
[2024-11-07 08:25:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:36,546 INFO L225 Difference]: With dead ends: 156
[2024-11-07 08:25:36,546 INFO L226 Difference]: Without dead ends: 108
[2024-11-07 08:25:36,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:25:36,548 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:36,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 251 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2024-11-07 08:25:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2024-11-07 08:25:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97.
[2024-11-07 08:25:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-07 08:25:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions.
[2024-11-07 08:25:36,572 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 105
[2024-11-07 08:25:36,574 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:36,574 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions.
[2024-11-07 08:25:36,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions.
[2024-11-07 08:25:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-07 08:25:36,577 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:36,577 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:36,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 08:25:36,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:36,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:36,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash 627351345, now seen corresponding path program 1 times
[2024-11-07 08:25:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:25:36,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356205869]
[2024-11-07 08:25:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:36,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:36,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:25:36,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:25:36,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 08:25:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:37,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 08:25:37,028 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:25:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-07 08:25:37,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:25:37,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:25:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356205869]
[2024-11-07 08:25:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356205869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:25:37,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:25:37,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:25:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291045095]
[2024-11-07 08:25:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:25:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:25:37,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:25:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:25:37,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:25:37,074 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:37,520 INFO L93 Difference]: Finished difference Result 145 states and 211 transitions.
[2024-11-07 08:25:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:25:37,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105
[2024-11-07 08:25:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:37,522 INFO L225 Difference]: With dead ends: 145
[2024-11-07 08:25:37,522 INFO L226 Difference]: Without dead ends: 97
[2024-11-07 08:25:37,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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 08:25:37,523 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:37,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 08:25:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2024-11-07 08:25:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2024-11-07 08:25:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-07 08:25:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions.
[2024-11-07 08:25:37,544 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 105
[2024-11-07 08:25:37,545 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:37,545 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions.
[2024-11-07 08:25:37,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-07 08:25:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions.
[2024-11-07 08:25:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2024-11-07 08:25:37,547 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:37,547 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:37,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-07 08:25:37,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:37,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:37,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash -798458518, now seen corresponding path program 1 times
[2024-11-07 08:25:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:25:37,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711815814]
[2024-11-07 08:25:37,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:37,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:25:37,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:25:37,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-07 08:25:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:38,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 08:25:38,008 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:25:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked.
[2024-11-07 08:25:38,135 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:25:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-07 08:25:38,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:25:38,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711815814]
[2024-11-07 08:25:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711815814] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:25:38,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 08:25:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8
[2024-11-07 08:25:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386688233]
[2024-11-07 08:25:38,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:25:38,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 08:25:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:25:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 08:25:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-07 08:25:38,406 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-07 08:25:41,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 08:25:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:25:41,787 INFO L93 Difference]: Finished difference Result 266 states and 369 transitions.
[2024-11-07 08:25:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 08:25:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 106
[2024-11-07 08:25:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:25:41,789 INFO L225 Difference]: With dead ends: 266
[2024-11-07 08:25:41,790 INFO L226 Difference]: Without dead ends: 172
[2024-11-07 08:25:41,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342
[2024-11-07 08:25:41,791 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 171 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:25:41,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 160 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2024-11-07 08:25:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states.
[2024-11-07 08:25:41,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 157.
[2024-11-07 08:25:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.1568627450980393) internal successors, (118), 102 states have internal predecessors, (118), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48)
[2024-11-07 08:25:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 214 transitions.
[2024-11-07 08:25:41,834 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 214 transitions. Word has length 106
[2024-11-07 08:25:41,834 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:25:41,834 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 214 transitions.
[2024-11-07 08:25:41,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19)
[2024-11-07 08:25:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions.
[2024-11-07 08:25:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2024-11-07 08:25:41,836 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:25:41,836 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:25:41,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-11-07 08:25:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:42,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:25:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:25:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash -739353174, now seen corresponding path program 1 times
[2024-11-07 08:25:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:25:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582840064]
[2024-11-07 08:25:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:25:42,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:25:42,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:25:42,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:25:42,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-07 08:25:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:25:42,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-07 08:25:42,244 INFO L278 TraceCheckSpWp]: Computing forward predicates...