./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.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_fillercode_fillercodestructure_filler-pr-ci_file-3.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', 'a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5']
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_fillercode_fillercodestructure_filler-pr-ci_file-3.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 a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 06:17:58,808 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 06:17:58,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 06:17:58,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 06:17:58,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 06:17:58,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 06:17:58,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 06:17:58,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 06:17:58,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 06:17:58,907 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 06:17:58,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 06:17:58,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 06:17:58,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 06:17:58,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 06:17:58,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 06:17:58,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 06:17:58,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 06:17:58,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 06:17:58,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 06:17:58,911 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 -> a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5
[2024-11-07 06:17:59,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 06:17:59,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 06:17:59,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 06:17:59,157 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 06:17:59,157 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 06:17:59,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i
[2024-11-07 06:18:00,442 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 06:18:00,661 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 06:18:00,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i
[2024-11-07 06:18:00,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57f5b9210/63256ff819374cfcb020fdab9a48df4e/FLAG72dd42016
[2024-11-07 06:18:00,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57f5b9210/63256ff819374cfcb020fdab9a48df4e
[2024-11-07 06:18:00,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 06:18:01,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 06:18:01,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 06:18:01,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 06:18:01,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 06:18:01,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:00" (1/1) ...
[2024-11-07 06:18:01,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a4d667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01, skipping insertion in model container
[2024-11-07 06:18:01,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:00" (1/1) ...
[2024-11-07 06:18:01,023 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 06:18:01,126 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931]
[2024-11-07 06:18:01,202 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 06:18:01,212 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 06:18:01,222 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931]
[2024-11-07 06:18:01,242 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 06:18:01,257 INFO L204 MainTranslator]: Completed translation
[2024-11-07 06:18:01,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01 WrapperNode
[2024-11-07 06:18:01,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 06:18:01,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 06:18:01,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 06:18:01,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 06:18:01,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,317 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238
[2024-11-07 06:18:01,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 06:18:01,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 06:18:01,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 06:18:01,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 06:18:01,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,357 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 06:18:01,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 06:18:01,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 06:18:01,400 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 06:18:01,400 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 06:18:01,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (1/1) ...
[2024-11-07 06:18:01,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 06:18:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 06:18:01,446 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 06:18:01,456 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 06:18:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 06:18:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 06:18:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 06:18:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 06:18:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 06:18:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 06:18:01,568 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 06:18:01,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 06:18:01,963 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-07 06:18:01,963 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 06:18:01,975 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 06:18:01,977 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 06:18:01,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:01 BoogieIcfgContainer
[2024-11-07 06:18:01,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 06:18:01,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 06:18:01,980 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 06:18:01,985 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 06:18:01,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:18:00" (1/3) ...
[2024-11-07 06:18:01,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f7c225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:18:01, skipping insertion in model container
[2024-11-07 06:18:01,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:01" (2/3) ...
[2024-11-07 06:18:01,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f7c225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:18:01, skipping insertion in model container
[2024-11-07 06:18:01,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:01" (3/3) ...
[2024-11-07 06:18:01,989 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i
[2024-11-07 06:18:02,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 06:18:02,002 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 06:18:02,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 06:18:02,053 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;@210086af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 06:18:02,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 06:18:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 80 states have (on average 1.55) internal successors, (124), 81 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 06:18:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-07 06:18:02,067 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:02,068 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:02,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:02,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1581001772, now seen corresponding path program 1 times
[2024-11-07 06:18:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539235930]
[2024-11-07 06:18:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:02,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539235930]
[2024-11-07 06:18:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539235930] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 06:18:02,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759930559]
[2024-11-07 06:18:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 06:18:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 06:18:02,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 06:18:02,488 INFO L87 Difference]: Start difference. First operand has 106 states, 80 states have (on average 1.55) internal successors, (124), 81 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:18:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:02,514 INFO L93 Difference]: Finished difference Result 205 states and 357 transitions.
[2024-11-07 06:18:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 06:18:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 160
[2024-11-07 06:18:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:02,521 INFO L225 Difference]: With dead ends: 205
[2024-11-07 06:18:02,522 INFO L226 Difference]: Without dead ends: 102
[2024-11-07 06:18:02,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 06:18:02,527 INFO L432 NwaCegarLoop]: 162 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, 162 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 06:18:02,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 06:18:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2024-11-07 06:18:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2024-11-07 06:18:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 77 states have internal predecessors, (116), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 06:18:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions.
[2024-11-07 06:18:02,562 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 160
[2024-11-07 06:18:02,562 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions.
[2024-11-07 06:18:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:18:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions.
[2024-11-07 06:18:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-07 06:18:02,565 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:02,565 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:02,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 06:18:02,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:02,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1926525738, now seen corresponding path program 1 times
[2024-11-07 06:18:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142185701]
[2024-11-07 06:18:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142185701]
[2024-11-07 06:18:03,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142185701] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:03,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:03,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 06:18:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744314755]
[2024-11-07 06:18:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:03,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 06:18:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 06:18:03,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 06:18:03,252 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:03,320 INFO L93 Difference]: Finished difference Result 300 states and 480 transitions.
[2024-11-07 06:18:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 06:18:03,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160
[2024-11-07 06:18:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:03,324 INFO L225 Difference]: With dead ends: 300
[2024-11-07 06:18:03,324 INFO L226 Difference]: Without dead ends: 201
[2024-11-07 06:18:03,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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 06:18:03,325 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 101 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:03,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 324 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 06:18:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2024-11-07 06:18:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199.
[2024-11-07 06:18:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46)
[2024-11-07 06:18:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 316 transitions.
[2024-11-07 06:18:03,351 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 316 transitions. Word has length 160
[2024-11-07 06:18:03,351 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:03,352 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 316 transitions.
[2024-11-07 06:18:03,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions.
[2024-11-07 06:18:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2024-11-07 06:18:03,354 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:03,354 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:03,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 06:18:03,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:03,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash 5358027, now seen corresponding path program 1 times
[2024-11-07 06:18:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:03,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080503944]
[2024-11-07 06:18:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:03,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:03,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080503944]
[2024-11-07 06:18:03,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080503944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 06:18:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68565879]
[2024-11-07 06:18:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:03,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 06:18:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:03,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 06:18:03,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 06:18:03,581 INFO L87 Difference]: Start difference. First operand 199 states and 316 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:03,669 INFO L93 Difference]: Finished difference Result 505 states and 804 transitions.
[2024-11-07 06:18:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 06:18:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161
[2024-11-07 06:18:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:03,673 INFO L225 Difference]: With dead ends: 505
[2024-11-07 06:18:03,673 INFO L226 Difference]: Without dead ends: 309
[2024-11-07 06:18:03,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 06:18:03,675 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 77 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:03,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 372 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 06:18:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2024-11-07 06:18:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 251.
[2024-11-07 06:18:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 202 states have (on average 1.5148514851485149) internal successors, (306), 202 states have internal predecessors, (306), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46)
[2024-11-07 06:18:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 398 transitions.
[2024-11-07 06:18:03,700 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 398 transitions. Word has length 161
[2024-11-07 06:18:03,701 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:03,701 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 398 transitions.
[2024-11-07 06:18:03,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 398 transitions.
[2024-11-07 06:18:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2024-11-07 06:18:03,703 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:03,704 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:03,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 06:18:03,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:03,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash 361578453, now seen corresponding path program 1 times
[2024-11-07 06:18:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452043774]
[2024-11-07 06:18:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452043774]
[2024-11-07 06:18:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452043774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 06:18:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415399678]
[2024-11-07 06:18:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:03,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 06:18:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:03,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 06:18:03,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 06:18:03,964 INFO L87 Difference]: Start difference. First operand 251 states and 398 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:04,112 INFO L93 Difference]: Finished difference Result 719 states and 1146 transitions.
[2024-11-07 06:18:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 06:18:04,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161
[2024-11-07 06:18:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:04,118 INFO L225 Difference]: With dead ends: 719
[2024-11-07 06:18:04,118 INFO L226 Difference]: Without dead ends: 471
[2024-11-07 06:18:04,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 06:18:04,120 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 135 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:04,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 411 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 06:18:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states.
[2024-11-07 06:18:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469.
[2024-11-07 06:18:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 372 states have (on average 1.4838709677419355) internal successors, (552), 372 states have internal predecessors, (552), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92)
[2024-11-07 06:18:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 736 transitions.
[2024-11-07 06:18:04,176 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 736 transitions. Word has length 161
[2024-11-07 06:18:04,176 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:04,176 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 736 transitions.
[2024-11-07 06:18:04,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 736 transitions.
[2024-11-07 06:18:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2024-11-07 06:18:04,178 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:04,178 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:04,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 06:18:04,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:04,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 56208470, now seen corresponding path program 1 times
[2024-11-07 06:18:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198202803]
[2024-11-07 06:18:04,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:04,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198202803]
[2024-11-07 06:18:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198202803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:04,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 06:18:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376893742]
[2024-11-07 06:18:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 06:18:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 06:18:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 06:18:04,457 INFO L87 Difference]: Start difference. First operand 469 states and 736 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:04,866 INFO L93 Difference]: Finished difference Result 1431 states and 2247 transitions.
[2024-11-07 06:18:04,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:04,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162
[2024-11-07 06:18:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:04,875 INFO L225 Difference]: With dead ends: 1431
[2024-11-07 06:18:04,877 INFO L226 Difference]: Without dead ends: 965
[2024-11-07 06:18:04,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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 06:18:04,880 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 337 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:04,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 555 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 06:18:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states.
[2024-11-07 06:18:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 757.
[2024-11-07 06:18:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 632 states have (on average 1.5063291139240507) internal successors, (952), 636 states have internal predecessors, (952), 116 states have call successors, (116), 8 states have call predecessors, (116), 8 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116)
[2024-11-07 06:18:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1184 transitions.
[2024-11-07 06:18:04,946 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1184 transitions. Word has length 162
[2024-11-07 06:18:04,946 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:04,946 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1184 transitions.
[2024-11-07 06:18:04,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1184 transitions.
[2024-11-07 06:18:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2024-11-07 06:18:04,950 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:04,950 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:04,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 06:18:04,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:04,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 857166822, now seen corresponding path program 1 times
[2024-11-07 06:18:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:04,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780642085]
[2024-11-07 06:18:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780642085]
[2024-11-07 06:18:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780642085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 06:18:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333778145]
[2024-11-07 06:18:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:05,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 06:18:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 06:18:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:05,251 INFO L87 Difference]: Start difference. First operand 757 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:05,766 INFO L93 Difference]: Finished difference Result 2591 states and 4087 transitions.
[2024-11-07 06:18:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:05,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162
[2024-11-07 06:18:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:05,778 INFO L225 Difference]: With dead ends: 2591
[2024-11-07 06:18:05,779 INFO L226 Difference]: Without dead ends: 1794
[2024-11-07 06:18:05,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:05,782 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 444 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:05,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 515 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 06:18:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states.
[2024-11-07 06:18:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1547.
[2024-11-07 06:18:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1329 states have (on average 1.5334838224228744) internal successors, (2038), 1336 states have internal predecessors, (2038), 203 states have call successors, (203), 14 states have call predecessors, (203), 14 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203)
[2024-11-07 06:18:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2444 transitions.
[2024-11-07 06:18:05,901 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2444 transitions. Word has length 162
[2024-11-07 06:18:05,901 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:05,901 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2444 transitions.
[2024-11-07 06:18:05,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2444 transitions.
[2024-11-07 06:18:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2024-11-07 06:18:05,905 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:05,905 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:05,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 06:18:05,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:05,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 723153316, now seen corresponding path program 1 times
[2024-11-07 06:18:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607077870]
[2024-11-07 06:18:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:05,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607077870]
[2024-11-07 06:18:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607077870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 06:18:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805841701]
[2024-11-07 06:18:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:06,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 06:18:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 06:18:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 06:18:06,281 INFO L87 Difference]: Start difference. First operand 1547 states and 2444 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:06,501 INFO L93 Difference]: Finished difference Result 4650 states and 7356 transitions.
[2024-11-07 06:18:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 06:18:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162
[2024-11-07 06:18:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:06,517 INFO L225 Difference]: With dead ends: 4650
[2024-11-07 06:18:06,517 INFO L226 Difference]: Without dead ends: 3106
[2024-11-07 06:18:06,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 06:18:06,524 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:06,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 414 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 06:18:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states.
[2024-11-07 06:18:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3084.
[2024-11-07 06:18:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2649 states have (on average 1.5352963382408455) internal successors, (4067), 2663 states have internal predecessors, (4067), 406 states have call successors, (406), 28 states have call predecessors, (406), 28 states have return successors, (406), 392 states have call predecessors, (406), 406 states have call successors, (406)
[2024-11-07 06:18:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4879 transitions.
[2024-11-07 06:18:06,741 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4879 transitions. Word has length 162
[2024-11-07 06:18:06,742 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:06,742 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 4879 transitions.
[2024-11-07 06:18:06,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4879 transitions.
[2024-11-07 06:18:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2024-11-07 06:18:06,746 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:06,746 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 06:18:06,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash 806280831, now seen corresponding path program 1 times
[2024-11-07 06:18:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:06,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900758338]
[2024-11-07 06:18:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 06:18:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900758338]
[2024-11-07 06:18:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900758338] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 06:18:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565324863]
[2024-11-07 06:18:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 06:18:08,412 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 06:18:08,427 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 06:18:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:08,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 06:18:08,584 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 06:18:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:08,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 06:18:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565324863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 06:18:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10
[2024-11-07 06:18:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916237173]
[2024-11-07 06:18:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 06:18:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 06:18:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-07 06:18:08,858 INFO L87 Difference]: Start difference. First operand 3084 states and 4879 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:10,255 INFO L93 Difference]: Finished difference Result 7370 states and 11505 transitions.
[2024-11-07 06:18:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 06:18:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163
[2024-11-07 06:18:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:10,282 INFO L225 Difference]: With dead ends: 7370
[2024-11-07 06:18:10,282 INFO L226 Difference]: Without dead ends: 4289
[2024-11-07 06:18:10,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-07 06:18:10,298 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:10,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 430 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-11-07 06:18:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states.
[2024-11-07 06:18:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4259.
[2024-11-07 06:18:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3740 states have (on average 1.5112299465240642) internal successors, (5652), 3782 states have internal predecessors, (5652), 462 states have call successors, (462), 56 states have call predecessors, (462), 56 states have return successors, (462), 420 states have call predecessors, (462), 462 states have call successors, (462)
[2024-11-07 06:18:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6576 transitions.
[2024-11-07 06:18:10,569 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6576 transitions. Word has length 163
[2024-11-07 06:18:10,570 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:10,570 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6576 transitions.
[2024-11-07 06:18:10,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6576 transitions.
[2024-11-07 06:18:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2024-11-07 06:18:10,574 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:10,575 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:10,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 06:18:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:10,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -623642279, now seen corresponding path program 1 times
[2024-11-07 06:18:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034541880]
[2024-11-07 06:18:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034541880]
[2024-11-07 06:18:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034541880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:11,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:11,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 06:18:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549633635]
[2024-11-07 06:18:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 06:18:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:11,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 06:18:11,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 06:18:11,143 INFO L87 Difference]: Start difference. First operand 4259 states and 6576 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:11,377 INFO L93 Difference]: Finished difference Result 8560 states and 13205 transitions.
[2024-11-07 06:18:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 06:18:11,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163
[2024-11-07 06:18:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:11,403 INFO L225 Difference]: With dead ends: 8560
[2024-11-07 06:18:11,403 INFO L226 Difference]: Without dead ends: 4304
[2024-11-07 06:18:11,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 06:18:11,415 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 99 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:11,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 415 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 06:18:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states.
[2024-11-07 06:18:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 4271.
[2024-11-07 06:18:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 3752 states have (on average 1.5087953091684434) internal successors, (5661), 3794 states have internal predecessors, (5661), 462 states have call successors, (462), 56 states have call predecessors, (462), 56 states have return successors, (462), 420 states have call predecessors, (462), 462 states have call successors, (462)
[2024-11-07 06:18:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 6585 transitions.
[2024-11-07 06:18:11,655 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 6585 transitions. Word has length 163
[2024-11-07 06:18:11,655 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:11,655 INFO L471 AbstractCegarLoop]: Abstraction has 4271 states and 6585 transitions.
[2024-11-07 06:18:11,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 6585 transitions.
[2024-11-07 06:18:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2024-11-07 06:18:11,659 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:11,659 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:11,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 06:18:11,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1080767375, now seen corresponding path program 1 times
[2024-11-07 06:18:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434925869]
[2024-11-07 06:18:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434925869]
[2024-11-07 06:18:11,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434925869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:11,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 06:18:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733659250]
[2024-11-07 06:18:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 06:18:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:11,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 06:18:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:11,890 INFO L87 Difference]: Start difference. First operand 4271 states and 6585 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:12,524 INFO L93 Difference]: Finished difference Result 10427 states and 16126 transitions.
[2024-11-07 06:18:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:12,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164
[2024-11-07 06:18:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:12,571 INFO L225 Difference]: With dead ends: 10427
[2024-11-07 06:18:12,571 INFO L226 Difference]: Without dead ends: 7505
[2024-11-07 06:18:12,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:12,584 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 452 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:12,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 518 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 06:18:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states.
[2024-11-07 06:18:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 6979.
[2024-11-07 06:18:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6979 states, 6164 states have (on average 1.5111940298507462) internal successors, (9315), 6230 states have internal predecessors, (9315), 726 states have call successors, (726), 88 states have call predecessors, (726), 88 states have return successors, (726), 660 states have call predecessors, (726), 726 states have call successors, (726)
[2024-11-07 06:18:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6979 states to 6979 states and 10767 transitions.
[2024-11-07 06:18:13,029 INFO L78 Accepts]: Start accepts. Automaton has 6979 states and 10767 transitions. Word has length 164
[2024-11-07 06:18:13,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:13,030 INFO L471 AbstractCegarLoop]: Abstraction has 6979 states and 10767 transitions.
[2024-11-07 06:18:13,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6979 states and 10767 transitions.
[2024-11-07 06:18:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2024-11-07 06:18:13,037 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:13,037 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:13,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 06:18:13,037 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1214780881, now seen corresponding path program 1 times
[2024-11-07 06:18:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314968136]
[2024-11-07 06:18:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314968136]
[2024-11-07 06:18:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314968136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 06:18:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670122419]
[2024-11-07 06:18:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 06:18:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:13,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 06:18:13,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-11-07 06:18:13,377 INFO L87 Difference]: Start difference. First operand 6979 states and 10767 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:18:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:13,891 INFO L93 Difference]: Finished difference Result 12050 states and 18611 transitions.
[2024-11-07 06:18:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 164
[2024-11-07 06:18:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:13,932 INFO L225 Difference]: With dead ends: 12050
[2024-11-07 06:18:13,933 INFO L226 Difference]: Without dead ends: 7046
[2024-11-07 06:18:13,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2024-11-07 06:18:13,949 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 322 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:13,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 663 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 06:18:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states.
[2024-11-07 06:18:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 6991.
[2024-11-07 06:18:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6991 states, 6176 states have (on average 1.5092292746113989) internal successors, (9321), 6242 states have internal predecessors, (9321), 726 states have call successors, (726), 88 states have call predecessors, (726), 88 states have return successors, (726), 660 states have call predecessors, (726), 726 states have call successors, (726)
[2024-11-07 06:18:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 10773 transitions.
[2024-11-07 06:18:14,376 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 10773 transitions. Word has length 164
[2024-11-07 06:18:14,377 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:14,377 INFO L471 AbstractCegarLoop]: Abstraction has 6991 states and 10773 transitions.
[2024-11-07 06:18:14,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:18:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 10773 transitions.
[2024-11-07 06:18:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2024-11-07 06:18:14,384 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:14,384 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 06:18:14,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2022198509, now seen corresponding path program 1 times
[2024-11-07 06:18:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745034777]
[2024-11-07 06:18:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:14,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745034777]
[2024-11-07 06:18:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745034777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:14,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:14,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 06:18:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303179460]
[2024-11-07 06:18:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:14,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 06:18:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:14,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 06:18:14,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:14,592 INFO L87 Difference]: Start difference. First operand 6991 states and 10773 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:15,182 INFO L93 Difference]: Finished difference Result 15256 states and 23595 transitions.
[2024-11-07 06:18:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 06:18:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164
[2024-11-07 06:18:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:15,218 INFO L225 Difference]: With dead ends: 15256
[2024-11-07 06:18:15,219 INFO L226 Difference]: Without dead ends: 10166
[2024-11-07 06:18:15,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 06:18:15,231 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 307 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:15,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 614 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 06:18:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10166 states.
[2024-11-07 06:18:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10166 to 9298.
[2024-11-07 06:18:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9298 states, 8261 states have (on average 1.5103498365815275) internal successors, (12477), 8345 states have internal predecessors, (12477), 924 states have call successors, (924), 112 states have call predecessors, (924), 112 states have return successors, (924), 840 states have call predecessors, (924), 924 states have call successors, (924)
[2024-11-07 06:18:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 14325 transitions.
[2024-11-07 06:18:15,677 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 14325 transitions. Word has length 164
[2024-11-07 06:18:15,678 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:15,678 INFO L471 AbstractCegarLoop]: Abstraction has 9298 states and 14325 transitions.
[2024-11-07 06:18:15,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 14325 transitions.
[2024-11-07 06:18:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2024-11-07 06:18:15,683 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:15,683 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:15,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 06:18:15,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2005290346, now seen corresponding path program 1 times
[2024-11-07 06:18:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976004445]
[2024-11-07 06:18:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 06:18:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976004445]
[2024-11-07 06:18:16,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976004445] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 06:18:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278899383]
[2024-11-07 06:18:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 06:18:16,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 06:18:16,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 06:18:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:16,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-07 06:18:16,801 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 06:18:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 609 proven. 54 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked.
[2024-11-07 06:18:17,388 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 06:18:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 06:18:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278899383] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 06:18:17,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 06:18:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 18
[2024-11-07 06:18:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504093728]
[2024-11-07 06:18:17,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 06:18:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-11-07 06:18:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-11-07 06:18:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306
[2024-11-07 06:18:17,722 INFO L87 Difference]: Start difference. First operand 9298 states and 14325 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44)
[2024-11-07 06:18:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:22,048 INFO L93 Difference]: Finished difference Result 32553 states and 48625 transitions.
[2024-11-07 06:18:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states.
[2024-11-07 06:18:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 164
[2024-11-07 06:18:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:22,136 INFO L225 Difference]: With dead ends: 32553
[2024-11-07 06:18:22,137 INFO L226 Difference]: Without dead ends: 23162
[2024-11-07 06:18:22,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1309, Invalid=4093, Unknown=0, NotChecked=0, Total=5402
[2024-11-07 06:18:22,169 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 2237 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:22,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2250 Valid, 1172 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2024-11-07 06:18:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23162 states.
[2024-11-07 06:18:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23162 to 12069.
[2024-11-07 06:18:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12069 states, 10356 states have (on average 1.4420625724217844) internal successors, (14934), 10497 states have internal predecessors, (14934), 1424 states have call successors, (1424), 288 states have call predecessors, (1424), 288 states have return successors, (1424), 1283 states have call predecessors, (1424), 1424 states have call successors, (1424)
[2024-11-07 06:18:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12069 states to 12069 states and 17782 transitions.
[2024-11-07 06:18:23,431 INFO L78 Accepts]: Start accepts. Automaton has 12069 states and 17782 transitions. Word has length 164
[2024-11-07 06:18:23,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:23,432 INFO L471 AbstractCegarLoop]: Abstraction has 12069 states and 17782 transitions.
[2024-11-07 06:18:23,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44)
[2024-11-07 06:18:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12069 states and 17782 transitions.
[2024-11-07 06:18:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-11-07 06:18:23,436 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:23,436 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:23,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 06:18:23,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:23,640 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash 275057401, now seen corresponding path program 1 times
[2024-11-07 06:18:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770122124]
[2024-11-07 06:18:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770122124]
[2024-11-07 06:18:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770122124] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 06:18:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636669558]
[2024-11-07 06:18:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:23,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 06:18:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 06:18:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 06:18:23,922 INFO L87 Difference]: Start difference. First operand 12069 states and 17782 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:24,859 INFO L93 Difference]: Finished difference Result 29862 states and 44112 transitions.
[2024-11-07 06:18:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 06:18:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165
[2024-11-07 06:18:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:24,930 INFO L225 Difference]: With dead ends: 29862
[2024-11-07 06:18:24,931 INFO L226 Difference]: Without dead ends: 17544
[2024-11-07 06:18:24,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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 06:18:24,968 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 225 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:24,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 628 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 06:18:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17544 states.
[2024-11-07 06:18:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17544 to 11475.
[2024-11-07 06:18:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11475 states, 9840 states have (on average 1.4465447154471545) internal successors, (14234), 9975 states have internal predecessors, (14234), 1358 states have call successors, (1358), 276 states have call predecessors, (1358), 276 states have return successors, (1358), 1223 states have call predecessors, (1358), 1358 states have call successors, (1358)
[2024-11-07 06:18:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 16950 transitions.
[2024-11-07 06:18:26,199 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 16950 transitions. Word has length 165
[2024-11-07 06:18:26,200 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:26,200 INFO L471 AbstractCegarLoop]: Abstraction has 11475 states and 16950 transitions.
[2024-11-07 06:18:26,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 16950 transitions.
[2024-11-07 06:18:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-11-07 06:18:26,203 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:26,204 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:26,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-07 06:18:26,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:26,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 337097015, now seen corresponding path program 1 times
[2024-11-07 06:18:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:26,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772813468]
[2024-11-07 06:18:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772813468]
[2024-11-07 06:18:26,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772813468] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 06:18:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041763881]
[2024-11-07 06:18:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:26,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 06:18:26,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 06:18:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 06:18:26,539 INFO L87 Difference]: Start difference. First operand 11475 states and 16950 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:27,379 INFO L93 Difference]: Finished difference Result 22939 states and 33886 transitions.
[2024-11-07 06:18:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:27,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165
[2024-11-07 06:18:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:27,429 INFO L225 Difference]: With dead ends: 22939
[2024-11-07 06:18:27,430 INFO L226 Difference]: Without dead ends: 11485
[2024-11-07 06:18:27,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-07 06:18:27,454 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 184 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:27,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 571 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 06:18:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11485 states.
[2024-11-07 06:18:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11485 to 11479.
[2024-11-07 06:18:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11479 states, 9844 states have (on average 1.446160097521333) internal successors, (14236), 9979 states have internal predecessors, (14236), 1358 states have call successors, (1358), 276 states have call predecessors, (1358), 276 states have return successors, (1358), 1223 states have call predecessors, (1358), 1358 states have call successors, (1358)
[2024-11-07 06:18:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11479 states to 11479 states and 16952 transitions.
[2024-11-07 06:18:28,206 INFO L78 Accepts]: Start accepts. Automaton has 11479 states and 16952 transitions. Word has length 165
[2024-11-07 06:18:28,207 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:28,207 INFO L471 AbstractCegarLoop]: Abstraction has 11479 states and 16952 transitions.
[2024-11-07 06:18:28,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 11479 states and 16952 transitions.
[2024-11-07 06:18:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-11-07 06:18:28,212 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:28,212 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:28,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-07 06:18:28,213 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1524793035, now seen corresponding path program 1 times
[2024-11-07 06:18:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315068443]
[2024-11-07 06:18:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315068443]
[2024-11-07 06:18:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315068443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:28,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 06:18:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932836438]
[2024-11-07 06:18:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:28,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 06:18:28,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:28,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 06:18:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:28,425 INFO L87 Difference]: Start difference. First operand 11479 states and 16952 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:29,513 INFO L93 Difference]: Finished difference Result 22017 states and 32462 transitions.
[2024-11-07 06:18:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165
[2024-11-07 06:18:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:29,582 INFO L225 Difference]: With dead ends: 22017
[2024-11-07 06:18:29,583 INFO L226 Difference]: Without dead ends: 16284
[2024-11-07 06:18:29,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 06:18:29,601 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 156 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:29,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 574 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 06:18:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16284 states.
[2024-11-07 06:18:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16284 to 13756.
[2024-11-07 06:18:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13756 states, 11800 states have (on average 1.4452542372881356) internal successors, (17054), 11962 states have internal predecessors, (17054), 1625 states have call successors, (1625), 330 states have call predecessors, (1625), 330 states have return successors, (1625), 1463 states have call predecessors, (1625), 1625 states have call successors, (1625)
[2024-11-07 06:18:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 20304 transitions.
[2024-11-07 06:18:30,625 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 20304 transitions. Word has length 165
[2024-11-07 06:18:30,625 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 13756 states and 20304 transitions.
[2024-11-07 06:18:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 20304 transitions.
[2024-11-07 06:18:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-11-07 06:18:30,629 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:30,629 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:30,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-07 06:18:30,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -151331884, now seen corresponding path program 1 times
[2024-11-07 06:18:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177889269]
[2024-11-07 06:18:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:30,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:30,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177889269]
[2024-11-07 06:18:30,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177889269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:30,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:30,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 06:18:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793886141]
[2024-11-07 06:18:30,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:30,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 06:18:30,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:30,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 06:18:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:30,952 INFO L87 Difference]: Start difference. First operand 13756 states and 20304 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:32,025 INFO L93 Difference]: Finished difference Result 24665 states and 36534 transitions.
[2024-11-07 06:18:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166
[2024-11-07 06:18:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:32,073 INFO L225 Difference]: With dead ends: 24665
[2024-11-07 06:18:32,074 INFO L226 Difference]: Without dead ends: 13762
[2024-11-07 06:18:32,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 06:18:32,098 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 92 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:32,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 537 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 06:18:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states.
[2024-11-07 06:18:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13752.
[2024-11-07 06:18:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13752 states, 11796 states have (on average 1.4452356731095286) internal successors, (17048), 11958 states have internal predecessors, (17048), 1625 states have call successors, (1625), 330 states have call predecessors, (1625), 330 states have return successors, (1625), 1463 states have call predecessors, (1625), 1625 states have call successors, (1625)
[2024-11-07 06:18:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13752 states to 13752 states and 20298 transitions.
[2024-11-07 06:18:33,010 INFO L78 Accepts]: Start accepts. Automaton has 13752 states and 20298 transitions. Word has length 166
[2024-11-07 06:18:33,011 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:33,011 INFO L471 AbstractCegarLoop]: Abstraction has 13752 states and 20298 transitions.
[2024-11-07 06:18:33,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13752 states and 20298 transitions.
[2024-11-07 06:18:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-11-07 06:18:33,013 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:33,013 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:33,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-07 06:18:33,014 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1485486184, now seen corresponding path program 1 times
[2024-11-07 06:18:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258161401]
[2024-11-07 06:18:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258161401]
[2024-11-07 06:18:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258161401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:33,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:33,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 06:18:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54192128]
[2024-11-07 06:18:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:33,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 06:18:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:33,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 06:18:33,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 06:18:33,161 INFO L87 Difference]: Start difference. First operand 13752 states and 20298 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:34,005 INFO L93 Difference]: Finished difference Result 23929 states and 35405 transitions.
[2024-11-07 06:18:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 06:18:34,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166
[2024-11-07 06:18:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:34,059 INFO L225 Difference]: With dead ends: 23929
[2024-11-07 06:18:34,059 INFO L226 Difference]: Without dead ends: 17627
[2024-11-07 06:18:34,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 06:18:34,077 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 155 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:34,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 06:18:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states.
[2024-11-07 06:18:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 15848.
[2024-11-07 06:18:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15848 states, 13595 states have (on average 1.4502390584773814) internal successors, (19716), 13781 states have internal predecessors, (19716), 1874 states have call successors, (1874), 378 states have call predecessors, (1874), 378 states have return successors, (1874), 1688 states have call predecessors, (1874), 1874 states have call successors, (1874)
[2024-11-07 06:18:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 23464 transitions.
[2024-11-07 06:18:34,964 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 23464 transitions. Word has length 166
[2024-11-07 06:18:34,964 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:34,964 INFO L471 AbstractCegarLoop]: Abstraction has 15848 states and 23464 transitions.
[2024-11-07 06:18:34,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)
[2024-11-07 06:18:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 23464 transitions.
[2024-11-07 06:18:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-11-07 06:18:34,967 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:34,967 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:34,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-07 06:18:34,967 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:34,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -356105936, now seen corresponding path program 1 times
[2024-11-07 06:18:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:34,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694966723]
[2024-11-07 06:18:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked.
[2024-11-07 06:18:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694966723]
[2024-11-07 06:18:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694966723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:18:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:18:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 06:18:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599200520]
[2024-11-07 06:18:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:18:35,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 06:18:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 06:18:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-07 06:18:35,839 INFO L87 Difference]: Start difference. First operand 15848 states and 23464 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:18:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:39,418 INFO L93 Difference]: Finished difference Result 56103 states and 82410 transitions.
[2024-11-07 06:18:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 06:18:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166
[2024-11-07 06:18:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:39,542 INFO L225 Difference]: With dead ends: 56103
[2024-11-07 06:18:39,542 INFO L226 Difference]: Without dead ends: 40276
[2024-11-07 06:18:39,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132
[2024-11-07 06:18:39,584 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 927 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:39,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 573 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-07 06:18:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states.
[2024-11-07 06:18:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 33153.
[2024-11-07 06:18:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33153 states, 28737 states have (on average 1.4636531301110067) internal successors, (42061), 29090 states have internal predecessors, (42061), 3670 states have call successors, (3670), 745 states have call predecessors, (3670), 745 states have return successors, (3670), 3317 states have call predecessors, (3670), 3670 states have call successors, (3670)
[2024-11-07 06:18:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33153 states to 33153 states and 49401 transitions.
[2024-11-07 06:18:42,246 INFO L78 Accepts]: Start accepts. Automaton has 33153 states and 49401 transitions. Word has length 166
[2024-11-07 06:18:42,247 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:42,247 INFO L471 AbstractCegarLoop]: Abstraction has 33153 states and 49401 transitions.
[2024-11-07 06:18:42,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:18:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 33153 states and 49401 transitions.
[2024-11-07 06:18:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-11-07 06:18:42,250 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:42,251 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:42,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-07 06:18:42,251 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:42,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1165452562, now seen corresponding path program 1 times
[2024-11-07 06:18:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905898285]
[2024-11-07 06:18:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 06:18:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 06:18:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 06:18:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 06:18:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 06:18:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 06:18:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 06:18:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 06:18:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 06:18:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 06:18:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 06:18:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 06:18:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 06:18:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 06:18:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 06:18:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88
[2024-11-07 06:18:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93
[2024-11-07 06:18:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99
[2024-11-07 06:18:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104
[2024-11-07 06:18:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110
[2024-11-07 06:18:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115
[2024-11-07 06:18:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121
[2024-11-07 06:18:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126
[2024-11-07 06:18:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 06:18:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 06:18:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905898285]
[2024-11-07 06:18:42,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905898285] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 06:18:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376033014]
[2024-11-07 06:18:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:42,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:42,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 06:18:42,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 06:18:42,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-07 06:18:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:18:42,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-07 06:18:42,557 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 06:18:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 396 proven. 15 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked.
[2024-11-07 06:18:42,655 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 06:18:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-07 06:18:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376033014] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 06:18:42,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 06:18:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9
[2024-11-07 06:18:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429882872]
[2024-11-07 06:18:42,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 06:18:42,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 06:18:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 06:18:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 06:18:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-11-07 06:18:42,861 INFO L87 Difference]: Start difference. First operand 33153 states and 49401 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2024-11-07 06:18:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:18:46,387 INFO L93 Difference]: Finished difference Result 76294 states and 113055 transitions.
[2024-11-07 06:18:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-07 06:18:46,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 166
[2024-11-07 06:18:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:18:46,550 INFO L225 Difference]: With dead ends: 76294
[2024-11-07 06:18:46,550 INFO L226 Difference]: Without dead ends: 41857
[2024-11-07 06:18:46,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306
[2024-11-07 06:18:46,633 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 345 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 06:18:46,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 608 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 06:18:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41857 states.
[2024-11-07 06:18:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41857 to 32524.
[2024-11-07 06:18:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32524 states, 27853 states have (on average 1.4188058736940365) internal successors, (39518), 28224 states have internal predecessors, (39518), 3796 states have call successors, (3796), 874 states have call predecessors, (3796), 874 states have return successors, (3796), 3425 states have call predecessors, (3796), 3796 states have call successors, (3796)
[2024-11-07 06:18:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32524 states to 32524 states and 47110 transitions.
[2024-11-07 06:18:49,714 INFO L78 Accepts]: Start accepts. Automaton has 32524 states and 47110 transitions. Word has length 166
[2024-11-07 06:18:49,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:18:49,715 INFO L471 AbstractCegarLoop]: Abstraction has 32524 states and 47110 transitions.
[2024-11-07 06:18:49,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2024-11-07 06:18:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 32524 states and 47110 transitions.
[2024-11-07 06:18:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-07 06:18:49,718 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:18:49,718 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:49,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-07 06:18:49,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:49,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:18:49,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:18:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash -754655283, now seen corresponding path program 1 times
[2024-11-07 06:18:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 06:18:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885156138]
[2024-11-07 06:18:49,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 06:18:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 06:18:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635363469]
[2024-11-07 06:18:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:18:49,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 06:18:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 06:18:49,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 06:18:49,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-07 06:18:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 06:18:50,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 06:18:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 06:18:50,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 06:18:50,265 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 06:18:50,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 06:18:50,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-07 06:18:50,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-11-07 06:18:50,475 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 06:18:50,572 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 06:18:50,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:18:50 BoogieIcfgContainer
[2024-11-07 06:18:50,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 06:18:50,576 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 06:18:50,576 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 06:18:50,576 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 06:18:50,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:01" (3/4) ...
[2024-11-07 06:18:50,579 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 06:18:50,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 06:18:50,580 INFO L158 Benchmark]: Toolchain (without parser) took 49580.04ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 117.0MB in the beginning and 649.2MB in the end (delta: -532.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB.
[2024-11-07 06:18:50,581 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 06:18:50,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.63ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 101.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 06:18:50,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.41ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 96.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 06:18:50,581 INFO L158 Benchmark]: Boogie Preprocessor took 80.28ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 91.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 06:18:50,581 INFO L158 Benchmark]: RCFGBuilder took 579.23ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 60.7MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-07 06:18:50,582 INFO L158 Benchmark]: TraceAbstraction took 48595.35ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 60.0MB in the beginning and 649.8MB in the end (delta: -589.8MB). Peak memory consumption was 985.2MB. Max. memory is 16.1GB.
[2024-11-07 06:18:50,582 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 1.7GB. Free memory was 649.8MB in the beginning and 649.2MB in the end (delta: 663.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 06:18:50,583 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.42ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 257.63ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 101.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 56.41ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 96.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 80.28ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 91.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 579.23ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 60.7MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 48595.35ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 60.0MB in the beginning and 649.8MB in the end (delta: -589.8MB). Peak memory consumption was 985.2MB. Max. memory is 16.1GB.
* Witness Printer took 3.83ms. Allocated memory is still 1.7GB. Free memory was 649.8MB in the beginning and 649.2MB in the end (delta: 663.7kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- 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 175, overapproximation of bitwiseOr at line 116, overapproximation of bitwiseAnd at line 97.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed char var_1_1 = -64;
[L23] unsigned char var_1_3 = 1;
[L24] signed char var_1_5 = -32;
[L25] unsigned short int var_1_6 = 256;
[L26] unsigned long int var_1_10 = 256;
[L27] double var_1_12 = 8.2;
[L28] signed char var_1_13 = 16;
[L29] signed char var_1_14 = 10;
[L30] double var_1_15 = 199.125;
[L31] double var_1_16 = 9.4;
[L32] double var_1_17 = 9999999999999.6;
[L33] unsigned char var_1_20 = 32;
[L34] unsigned char var_1_21 = 128;
[L35] unsigned char var_1_22 = 64;
[L36] unsigned long int var_1_23 = 64;
[L37] unsigned long int var_1_24 = 5;
[L38] signed short int var_1_28 = 256;
[L39] signed long int var_1_30 = -4;
[L40] double var_1_32 = 0.0;
[L41] unsigned short int var_1_34 = 34858;
[L42] unsigned short int var_1_35 = 41225;
[L43] double var_1_37 = 63.63;
[L44] signed char var_1_39 = 10;
[L45] signed char var_1_40 = -25;
[L46] signed char var_1_41 = 4;
[L47] unsigned char var_1_42 = 50;
[L48] unsigned long int last_1_var_1_10 = 256;
[L49] unsigned char last_1_var_1_20 = 32;
VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L179] isInitial = 1
[L180] FCALL initially()
[L181] COND TRUE 1
[L182] CALL updateLastVariables()
[L171] last_1_var_1_10 = var_1_10
[L172] last_1_var_1_20 = var_1_20
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L182] RET updateLastVariables()
[L183] CALL updateVariables()
[L134] var_1_3 = __VERIFIER_nondet_uchar()
[L135] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L135] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L136] CALL assume_abort_if_not(var_1_3 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L136] RET assume_abort_if_not(var_1_3 <= 1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256]
[L137] var_1_5 = __VERIFIER_nondet_char()
[L138] CALL assume_abort_if_not(var_1_5 >= -127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L138] RET assume_abort_if_not(var_1_5 >= -127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L139] CALL assume_abort_if_not(var_1_5 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L139] RET assume_abort_if_not(var_1_5 <= 126)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L140] var_1_13 = __VERIFIER_nondet_char()
[L141] CALL assume_abort_if_not(var_1_13 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L141] RET assume_abort_if_not(var_1_13 >= -1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L142] CALL assume_abort_if_not(var_1_13 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L142] RET assume_abort_if_not(var_1_13 <= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L143] var_1_14 = __VERIFIER_nondet_char()
[L144] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L144] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L145] CALL assume_abort_if_not(var_1_14 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L145] RET assume_abort_if_not(var_1_14 <= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L146] var_1_15 = __VERIFIER_nondet_double()
[L147] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L147] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L148] CALL assume_abort_if_not(var_1_15 != 0.0F)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L148] RET assume_abort_if_not(var_1_15 != 0.0F)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L149] var_1_16 = __VERIFIER_nondet_double()
[L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L151] var_1_21 = __VERIFIER_nondet_uchar()
[L152] CALL assume_abort_if_not(var_1_21 >= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L152] RET assume_abort_if_not(var_1_21 >= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L153] CALL assume_abort_if_not(var_1_21 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L153] RET assume_abort_if_not(var_1_21 <= 254)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L154] var_1_22 = __VERIFIER_nondet_uchar()
[L155] CALL assume_abort_if_not(var_1_22 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L155] RET assume_abort_if_not(var_1_22 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L156] CALL assume_abort_if_not(var_1_22 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L156] RET assume_abort_if_not(var_1_22 <= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L157] var_1_34 = __VERIFIER_nondet_ushort()
[L158] CALL assume_abort_if_not(var_1_34 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L158] RET assume_abort_if_not(var_1_34 >= 32767)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L159] CALL assume_abort_if_not(var_1_34 <= 65535)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L159] RET assume_abort_if_not(var_1_34 <= 65535)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L160] var_1_35 = __VERIFIER_nondet_ushort()
[L161] CALL assume_abort_if_not(var_1_35 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L161] RET assume_abort_if_not(var_1_35 >= 32767)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L162] CALL assume_abort_if_not(var_1_35 <= 65535)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L162] RET assume_abort_if_not(var_1_35 <= 65535)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L163] var_1_40 = __VERIFIER_nondet_char()
[L164] CALL assume_abort_if_not(var_1_40 >= -63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L164] RET assume_abort_if_not(var_1_40 >= -63)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L165] CALL assume_abort_if_not(var_1_40 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L165] RET assume_abort_if_not(var_1_40 <= 63)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256]
[L166] var_1_41 = __VERIFIER_nondet_char()
[L167] CALL assume_abort_if_not(var_1_41 >= -63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L167] RET assume_abort_if_not(var_1_41 >= -63)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L168] CALL assume_abort_if_not(var_1_41 <= 63)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L168] RET assume_abort_if_not(var_1_41 <= 63)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L183] RET updateVariables()
[L184] CALL step()
[L53] COND FALSE !(\read(var_1_3))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L58] COND FALSE !(var_1_20 > var_1_21)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L71] signed long int stepLocal_2 = var_1_5 * var_1_13;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L72] COND TRUE stepLocal_2 > last_1_var_1_10
[L73] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8))))))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L75] var_1_28 = var_1_5
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L76] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L77] COND FALSE !(\read(var_1_3))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L81] COND FALSE !(var_1_14 >= ((((var_1_20) > (var_1_6)) ? (var_1_20) : (var_1_6))))
[L84] var_1_24 = (((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L86] unsigned char stepLocal_1 = var_1_17 <= var_1_17;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L87] COND FALSE !(stepLocal_1 || var_1_3)
[L92] var_1_12 = var_1_16
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L94] EXPR var_1_14 ^ var_1_21
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L94] COND TRUE ((var_1_14 ^ var_1_21) % var_1_21) > -10
[L95] var_1_30 = ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L97] EXPR var_1_35 & var_1_20
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L97] EXPR (var_1_35 & var_1_20) >> var_1_14
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L97] COND TRUE var_1_14 >= ((var_1_35 & var_1_20) >> var_1_14)
[L98] var_1_37 = ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16)))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L100] COND FALSE !(99999.8f < var_1_17)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L111] COND FALSE !((var_1_17 + var_1_12) <= var_1_17)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L116] EXPR var_1_6 ^ var_1_20
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L116] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23;
[L117] COND FALSE !(var_1_20 <= stepLocal_0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L122] EXPR ((((var_1_5) > (-16)) ? (var_1_5) : (-16))) & 16
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L122] COND FALSE !((~ var_1_23) <= (((((var_1_5) > (-16)) ? (var_1_5) : (-16))) & 16))
[L125] COND TRUE var_1_10 <= (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))
[L126] var_1_32 = var_1_16
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L131] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41))))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L184] RET step()
[L185] CALL, EXPR property()
[L175] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L175-L176] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1)
;
[L185] RET, EXPR property()
[L185] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.4s, OverallIterations: 21, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6801 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6770 mSDsluCounter, 10640 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6611 mSDsCounter, 1110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4647 IncrementalHoareTripleChecker+Invalid, 5757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1110 mSolverCounterUnsat, 4029 mSDtfsCounter, 4647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1970 GetRequests, 1812 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33153occurred in iteration=19, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 39992 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 4098 NumberOfCodeBlocks, 4098 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4067 ConstructedInterpolants, 19 QuantifiedInterpolants, 15318 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 25129/25300 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 06:18:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
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_fillercode_fillercodestructure_filler-pr-ci_file-3.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 a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 06:18:52,992 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 06:18:53,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 06:18:53,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 06:18:53,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 06:18:53,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 06:18:53,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 06:18:53,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 06:18:53,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 06:18:53,125 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 06:18:53,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 06:18:53,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 06:18:53,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 06:18:53,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 06:18:53,126 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 06:18:53,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 06:18:53,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 06:18:53,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 06:18:53,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 06:18:53,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 06:18:53,128 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 -> a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5
[2024-11-07 06:18:53,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 06:18:53,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 06:18:53,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 06:18:53,424 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 06:18:53,424 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 06:18:53,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i
[2024-11-07 06:18:54,730 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 06:18:54,999 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 06:18:54,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i
[2024-11-07 06:18:55,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8899cf580/58c91700b79d415a978c83174efc7b09/FLAG974bee379
[2024-11-07 06:18:55,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8899cf580/58c91700b79d415a978c83174efc7b09
[2024-11-07 06:18:55,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 06:18:55,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 06:18:55,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 06:18:55,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 06:18:55,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 06:18:55,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369a738f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55, skipping insertion in model container
[2024-11-07 06:18:55,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,095 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 06:18:55,232 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931]
[2024-11-07 06:18:55,287 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 06:18:55,308 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 06:18:55,318 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931]
[2024-11-07 06:18:55,347 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 06:18:55,362 INFO L204 MainTranslator]: Completed translation
[2024-11-07 06:18:55,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55 WrapperNode
[2024-11-07 06:18:55,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 06:18:55,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 06:18:55,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 06:18:55,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 06:18:55,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,428 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171
[2024-11-07 06:18:55,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 06:18:55,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 06:18:55,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 06:18:55,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 06:18:55,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,475 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 06:18:55,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 06:18:55,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 06:18:55,510 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 06:18:55,510 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 06:18:55,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (1/1) ...
[2024-11-07 06:18:55,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 06:18:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 06:18:55,549 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 06:18:55,564 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 06:18:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 06:18:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 06:18:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 06:18:55,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 06:18:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 06:18:55,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 06:18:55,683 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 06:18:55,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 06:19:10,777 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-07 06:19:10,777 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 06:19:10,791 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 06:19:10,792 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 06:19:10,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:19:10 BoogieIcfgContainer
[2024-11-07 06:19:10,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 06:19:10,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 06:19:10,794 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 06:19:10,804 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 06:19:10,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:18:55" (1/3) ...
[2024-11-07 06:19:10,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2bfcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:19:10, skipping insertion in model container
[2024-11-07 06:19:10,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:55" (2/3) ...
[2024-11-07 06:19:10,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2bfcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:19:10, skipping insertion in model container
[2024-11-07 06:19:10,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:19:10" (3/3) ...
[2024-11-07 06:19:10,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i
[2024-11-07 06:19:10,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 06:19:10,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 06:19:10,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 06:19:10,896 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;@1144aa42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 06:19:10,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 06:19:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 06:19:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-07 06:19:10,913 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:19:10,914 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:10,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:19:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:19:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2022594804, now seen corresponding path program 1 times
[2024-11-07 06:19:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 06:19:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494814540]
[2024-11-07 06:19:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:19:10,929 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 06:19:10,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 06:19:10,939 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 06:19:10,954 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 06:19:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 06:19:12,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 06:19:12,250 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 06:19:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked.
[2024-11-07 06:19:12,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 06:19:12,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 06:19:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494814540]
[2024-11-07 06:19:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494814540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 06:19:12,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 06:19:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 06:19:12,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24535810]
[2024-11-07 06:19:12,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 06:19:12,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 06:19:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 06:19:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 06:19:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 06:19:12,304 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:19:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 06:19:12,337 INFO L93 Difference]: Finished difference Result 159 states and 281 transitions.
[2024-11-07 06:19:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 06:19:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153
[2024-11-07 06:19:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 06:19:12,344 INFO L225 Difference]: With dead ends: 159
[2024-11-07 06:19:12,344 INFO L226 Difference]: Without dead ends: 79
[2024-11-07 06:19:12,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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 06:19:12,349 INFO L432 NwaCegarLoop]: 124 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, 124 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 06:19:12,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 06:19:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2024-11-07 06:19:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2024-11-07 06:19:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2024-11-07 06:19:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions.
[2024-11-07 06:19:12,382 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 153
[2024-11-07 06:19:12,382 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 06:19:12,382 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions.
[2024-11-07 06:19:12,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)
[2024-11-07 06:19:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions.
[2024-11-07 06:19:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2024-11-07 06:19:12,385 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 06:19:12,385 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:19:12,425 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 (2)] Ended with exit code 0
[2024-11-07 06:19:12,586 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 06:19:12,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 06:19:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 06:19:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1942170698, now seen corresponding path program 1 times
[2024-11-07 06:19:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 06:19:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119138432]
[2024-11-07 06:19:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 06:19:12,589 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 06:19:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 06:19:12,592 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 06:19:12,595 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