./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.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_variablewrapping_normal_file-55.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', '90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740']
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_variablewrapping_normal_file-55.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 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 10:03:28,311 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 10:03:28,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 10:03:28,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 10:03:28,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 10:03:28,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 10:03:28,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 10:03:28,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 10:03:28,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 10:03:28,420 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 10:03:28,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 10:03:28,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 10:03:28,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 10:03:28,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 10:03:28,421 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 10:03:28,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 10:03:28,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 10:03:28,422 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 10:03:28,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 10:03:28,422 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 10:03:28,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 10:03:28,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 10:03:28,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 10:03:28,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 10:03:28,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 10:03:28,424 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 -> 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740
[2024-11-07 10:03:28,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 10:03:28,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 10:03:28,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 10:03:28,662 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 10:03:28,663 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 10:03:28,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i
[2024-11-07 10:03:29,798 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 10:03:29,990 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 10:03:29,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i
[2024-11-07 10:03:29,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4deeb351e/1612289680854ebeb6fd2d071a1c888d/FLAGfa98db112
[2024-11-07 10:03:30,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4deeb351e/1612289680854ebeb6fd2d071a1c888d
[2024-11-07 10:03:30,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 10:03:30,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 10:03:30,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 10:03:30,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 10:03:30,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 10:03:30,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602312b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30, skipping insertion in model container
[2024-11-07 10:03:30,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,384 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 10:03:30,486 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_variablewrapping_normal_file-55.i[913,926]
[2024-11-07 10:03:30,535 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 10:03:30,544 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 10:03:30,554 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_variablewrapping_normal_file-55.i[913,926]
[2024-11-07 10:03:30,575 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 10:03:30,591 INFO L204 MainTranslator]: Completed translation
[2024-11-07 10:03:30,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30 WrapperNode
[2024-11-07 10:03:30,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 10:03:30,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 10:03:30,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 10:03:30,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 10:03:30,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,644 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147
[2024-11-07 10:03:30,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 10:03:30,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 10:03:30,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 10:03:30,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 10:03:30,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,670 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 10:03:30,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 10:03:30,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 10:03:30,697 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 10:03:30,698 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 10:03:30,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (1/1) ...
[2024-11-07 10:03:30,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 10:03:30,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 10:03:30,730 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 10:03:30,732 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 10:03:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 10:03:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 10:03:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 10:03:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 10:03:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 10:03:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 10:03:30,810 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 10:03:30,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 10:03:31,047 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live.
[2024-11-07 10:03:31,048 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 10:03:31,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 10:03:31,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 10:03:31,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:31 BoogieIcfgContainer
[2024-11-07 10:03:31,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 10:03:31,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 10:03:31,059 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 10:03:31,062 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 10:03:31,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:03:30" (1/3) ...
[2024-11-07 10:03:31,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474aae3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:31, skipping insertion in model container
[2024-11-07 10:03:31,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:30" (2/3) ...
[2024-11-07 10:03:31,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474aae3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:31, skipping insertion in model container
[2024-11-07 10:03:31,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:31" (3/3) ...
[2024-11-07 10:03:31,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-55.i
[2024-11-07 10:03:31,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 10:03:31,075 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 10:03:31,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 10:03:31,124 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;@56518f14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 10:03:31,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 10:03:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 10:03:31,136 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:31,137 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:31,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:31,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:31,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1967464758, now seen corresponding path program 1 times
[2024-11-07 10:03:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 10:03:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843051530]
[2024-11-07 10:03:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 10:03:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 10:03:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 10:03:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 10:03:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 10:03:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 10:03:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 10:03:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 10:03:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 10:03:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 10:03:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 10:03:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 10:03:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 10:03:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-07 10:03:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 10:03:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843051530]
[2024-11-07 10:03:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843051530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 10:03:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143689389]
[2024-11-07 10:03:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:31,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 10:03:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 10:03:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 10:03:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 10:03:31,451 INFO L87 Difference]: Start difference. First operand has 62 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2024-11-07 10:03:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:31,472 INFO L93 Difference]: Finished difference Result 117 states and 184 transitions.
[2024-11-07 10:03:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 10:03:31,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86
[2024-11-07 10:03:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:31,478 INFO L225 Difference]: With dead ends: 117
[2024-11-07 10:03:31,479 INFO L226 Difference]: Without dead ends: 58
[2024-11-07 10:03:31,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 10:03:31,485 INFO L432 NwaCegarLoop]: 82 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, 82 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 10:03:31,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 10:03:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2024-11-07 10:03:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2024-11-07 10:03:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions.
[2024-11-07 10:03:31,519 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 86
[2024-11-07 10:03:31,520 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:31,520 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions.
[2024-11-07 10:03:31,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2024-11-07 10:03:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions.
[2024-11-07 10:03:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 10:03:31,524 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:31,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:31,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 10:03:31,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -39431618, now seen corresponding path program 1 times
[2024-11-07 10:03:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 10:03:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096397375]
[2024-11-07 10:03:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 10:03:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 10:03:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 10:03:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 10:03:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 10:03:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 10:03:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 10:03:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 10:03:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 10:03:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 10:03:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 10:03:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 10:03:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 10:03:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-07 10:03:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 10:03:31,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096397375]
[2024-11-07 10:03:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096397375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:31,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 10:03:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762796123]
[2024-11-07 10:03:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:31,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 10:03:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 10:03:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 10:03:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 10:03:31,719 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:31,755 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions.
[2024-11-07 10:03:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 10:03:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86
[2024-11-07 10:03:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:31,759 INFO L225 Difference]: With dead ends: 141
[2024-11-07 10:03:31,759 INFO L226 Difference]: Without dead ends: 86
[2024-11-07 10:03:31,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 10:03:31,764 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 10:03:31,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 152 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 10:03:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2024-11-07 10:03:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59.
[2024-11-07 10:03:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions.
[2024-11-07 10:03:31,775 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 86
[2024-11-07 10:03:31,776 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions.
[2024-11-07 10:03:31,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions.
[2024-11-07 10:03:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 10:03:31,777 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:31,778 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 10:03:31,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:31,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 218733820, now seen corresponding path program 1 times
[2024-11-07 10:03:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 10:03:31,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268987384]
[2024-11-07 10:03:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 10:03:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 10:03:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 10:03:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 10:03:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 10:03:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 10:03:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 10:03:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 10:03:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 10:03:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 10:03:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 10:03:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 10:03:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 10:03:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-07 10:03:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 10:03:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268987384]
[2024-11-07 10:03:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268987384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:31,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:31,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 10:03:31,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699733661]
[2024-11-07 10:03:31,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:31,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 10:03:31,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 10:03:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 10:03:31,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 10:03:31,969 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:32,008 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions.
[2024-11-07 10:03:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 10:03:32,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86
[2024-11-07 10:03:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:32,010 INFO L225 Difference]: With dead ends: 115
[2024-11-07 10:03:32,010 INFO L226 Difference]: Without dead ends: 59
[2024-11-07 10:03:32,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 10:03:32,011 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 10:03:32,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 10:03:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2024-11-07 10:03:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2024-11-07 10:03:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions.
[2024-11-07 10:03:32,016 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 86
[2024-11-07 10:03:32,016 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:32,016 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions.
[2024-11-07 10:03:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions.
[2024-11-07 10:03:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2024-11-07 10:03:32,017 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:32,018 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:32,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 10:03:32,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:32,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1666492727, now seen corresponding path program 1 times
[2024-11-07 10:03:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 10:03:32,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815668982]
[2024-11-07 10:03:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 10:03:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 10:03:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 10:03:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 10:03:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 10:03:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 10:03:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 10:03:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 10:03:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 10:03:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 10:03:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 10:03:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 10:03:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 10:03:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-07 10:03:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 10:03:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815668982]
[2024-11-07 10:03:32,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815668982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:32,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:32,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 10:03:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842597487]
[2024-11-07 10:03:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:32,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 10:03:32,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 10:03:32,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 10:03:32,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 10:03:32,473 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:32,658 INFO L93 Difference]: Finished difference Result 172 states and 241 transitions.
[2024-11-07 10:03:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 10:03:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88
[2024-11-07 10:03:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:32,661 INFO L225 Difference]: With dead ends: 172
[2024-11-07 10:03:32,663 INFO L226 Difference]: Without dead ends: 116
[2024-11-07 10:03:32,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-07 10:03:32,665 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 10:03:32,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 259 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 10:03:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2024-11-07 10:03:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106.
[2024-11-07 10:03:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-07 10:03:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions.
[2024-11-07 10:03:32,688 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 88
[2024-11-07 10:03:32,690 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:32,690 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions.
[2024-11-07 10:03:32,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions.
[2024-11-07 10:03:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-07 10:03:32,691 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:32,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:32,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 10:03:32,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:32,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:32,693 INFO L85 PathProgramCache]: Analyzing trace with hash 885346931, now seen corresponding path program 1 times
[2024-11-07 10:03:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 10:03:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276130285]
[2024-11-07 10:03:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 10:03:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 10:03:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 10:03:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 10:03:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 10:03:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 10:03:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33
[2024-11-07 10:03:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-07 10:03:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-07 10:03:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-07 10:03:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-07 10:03:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-07 10:03:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-07 10:03:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-07 10:03:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 10:03:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276130285]
[2024-11-07 10:03:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276130285] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:33,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:33,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 10:03:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115379736]
[2024-11-07 10:03:33,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 10:03:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 10:03:33,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 10:03:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 10:03:33,102 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:33,194 INFO L93 Difference]: Finished difference Result 204 states and 281 transitions.
[2024-11-07 10:03:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 10:03:33,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90
[2024-11-07 10:03:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:33,197 INFO L225 Difference]: With dead ends: 204
[2024-11-07 10:03:33,197 INFO L226 Difference]: Without dead ends: 148
[2024-11-07 10:03:33,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 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 10:03:33,198 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 10:03:33,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 192 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 10:03:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2024-11-07 10:03:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130.
[2024-11-07 10:03:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 103 states have internal predecessors, (130), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-07 10:03:33,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions.
[2024-11-07 10:03:33,219 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 90
[2024-11-07 10:03:33,219 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:33,219 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions.
[2024-11-07 10:03:33,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions.
[2024-11-07 10:03:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-07 10:03:33,221 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:33,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 10:03:33,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -422807977, now seen corresponding path program 1 times
[2024-11-07 10:03:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 10:03:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311965392]
[2024-11-07 10:03:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 10:03:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 10:03:33,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 10:03:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 10:03:33,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 10:03:33,301 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 10:03:33,302 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 10:03:33,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 10:03:33,306 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-11-07 10:03:33,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 10:03:33,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:03:33 BoogieIcfgContainer
[2024-11-07 10:03:33,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 10:03:33,365 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 10:03:33,365 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 10:03:33,365 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 10:03:33,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:31" (3/4) ...
[2024-11-07 10:03:33,368 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 10:03:33,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 10:03:33,369 INFO L158 Benchmark]: Toolchain (without parser) took 3006.14ms. Allocated memory is still 142.6MB. Free memory was 116.6MB in the beginning and 72.3MB in the end (delta: 44.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB.
[2024-11-07 10:03:33,369 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 10:03:33,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.90ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 103.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 10:03:33,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.98ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 101.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 10:03:33,370 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 98.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 10:03:33,370 INFO L158 Benchmark]: RCFGBuilder took 359.24ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 80.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 10:03:33,370 INFO L158 Benchmark]: TraceAbstraction took 2306.47ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 73.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-07 10:03:33,370 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 72.3MB in the end (delta: 739.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 10:03:33,371 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.64ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 228.90ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 103.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 50.98ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 101.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 51.62ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 98.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 359.24ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 80.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 2306.47ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 73.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Witness Printer took 3.74ms. Allocated memory is still 142.6MB. Free memory was 73.0MB in the beginning and 72.3MB in the end (delta: 739.2kB). 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 someBinaryFLOATComparisonOperation at line 97, overapproximation of shiftRight at line 60, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 97.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 10;
[L23] unsigned char var_1_2 = 0;
[L24] unsigned char var_1_5 = 0;
[L25] double var_1_7 = 256.75;
[L26] double var_1_8 = 63.5;
[L27] double var_1_9 = 1.8;
[L28] double var_1_10 = 0.25;
[L29] double var_1_11 = 16.5;
[L30] signed long int var_1_12 = -5;
[L31] unsigned char var_1_14 = 128;
[L32] float var_1_15 = 4.6;
[L33] unsigned long int var_1_16 = 500;
[L34] unsigned char var_1_17 = 2;
[L35] unsigned char var_1_18 = 100;
[L36] signed long int last_1_var_1_12 = -5;
[L37] unsigned char last_1_var_1_17 = 2;
VAL [isInitial=0, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L101] isInitial = 1
[L102] FCALL initially()
[L103] COND TRUE 1
[L104] CALL updateLastVariables()
[L93] last_1_var_1_12 = var_1_12
[L94] last_1_var_1_17 = var_1_17
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L104] RET updateLastVariables()
[L105] CALL updateVariables()
[L71] var_1_2 = __VERIFIER_nondet_uchar()
[L72] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L72] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L73] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L73] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L74] var_1_5 = __VERIFIER_nondet_uchar()
[L75] CALL assume_abort_if_not(var_1_5 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L75] RET assume_abort_if_not(var_1_5 >= 0)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L76] CALL assume_abort_if_not(var_1_5 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L76] RET assume_abort_if_not(var_1_5 <= 1)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5]
[L77] var_1_8 = __VERIFIER_nondet_double()
[L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5]
[L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5]
[L79] var_1_9 = __VERIFIER_nondet_double()
[L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L81] var_1_10 = __VERIFIER_nondet_double()
[L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L83] var_1_11 = __VERIFIER_nondet_double()
[L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L85] var_1_14 = __VERIFIER_nondet_uchar()
[L86] CALL assume_abort_if_not(var_1_14 >= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L86] RET assume_abort_if_not(var_1_14 >= 127)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L87] CALL assume_abort_if_not(var_1_14 <= 255)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L87] RET assume_abort_if_not(var_1_14 <= 255)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L88] var_1_18 = __VERIFIER_nondet_uchar()
[L89] CALL assume_abort_if_not(var_1_18 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L89] RET assume_abort_if_not(var_1_18 >= 0)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L90] CALL assume_abort_if_not(var_1_18 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L90] RET assume_abort_if_not(var_1_18 <= 254)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L105] RET updateVariables()
[L106] CALL step()
[L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17;
[L42] signed long int stepLocal_0 = last_1_var_1_17;
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L43] COND TRUE \read(var_1_2)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L44] COND FALSE !(stepLocal_1 && var_1_5)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4]
[L54] COND TRUE \read(var_1_2)
[L55] var_1_7 = (((var_1_8 + var_1_9) + var_1_10) - var_1_11)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1]
[L57] var_1_15 = var_1_8
[L58] var_1_16 = var_1_14
[L59] var_1_17 = var_1_18
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L60] EXPR -4 >> var_1_1
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L60] EXPR -4 >> var_1_1
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1));
[L61] signed long int stepLocal_2 = var_1_1 / -8;
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-256, var_1_12=-5, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L62] COND FALSE !((~ var_1_17) <= stepLocal_3)
[L67] var_1_12 = (var_1_17 - var_1_14)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L106] RET step()
[L107] CALL, EXPR property()
[L97] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L97-L98] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((float) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18))
;
[L107] RET, EXPR property()
[L107] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=0, var_1_14=254, var_1_15=505, var_1_16=254, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 825 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 446 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 379 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=5, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 527 NumberOfCodeBlocks, 527 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 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 10:03:33,403 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_variablewrapping_normal_file-55.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 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 10:03:35,129 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 10:03:35,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 10:03:35,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 10:03:35,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 10:03:35,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 10:03:35,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 10:03:35,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 10:03:35,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 10:03:35,223 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 10:03:35,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 10:03:35,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 10:03:35,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 10:03:35,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 10:03:35,223 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 10:03:35,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 10:03:35,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 10:03:35,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 10:03:35,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 10:03:35,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 10:03:35,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 10:03:35,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 10:03:35,226 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 -> 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740
[2024-11-07 10:03:35,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 10:03:35,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 10:03:35,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 10:03:35,497 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 10:03:35,498 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 10:03:35,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i
[2024-11-07 10:03:36,649 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 10:03:36,866 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 10:03:36,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i
[2024-11-07 10:03:36,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d3b67953/ea074e18e5c1405b9932f092786d87bf/FLAG6ce0f08ba
[2024-11-07 10:03:37,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d3b67953/ea074e18e5c1405b9932f092786d87bf
[2024-11-07 10:03:37,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 10:03:37,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 10:03:37,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 10:03:37,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 10:03:37,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 10:03:37,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762d941e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37, skipping insertion in model container
[2024-11-07 10:03:37,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,242 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 10:03:37,338 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_variablewrapping_normal_file-55.i[913,926]
[2024-11-07 10:03:37,366 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 10:03:37,376 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 10:03:37,387 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_variablewrapping_normal_file-55.i[913,926]
[2024-11-07 10:03:37,401 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 10:03:37,413 INFO L204 MainTranslator]: Completed translation
[2024-11-07 10:03:37,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37 WrapperNode
[2024-11-07 10:03:37,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 10:03:37,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 10:03:37,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 10:03:37,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 10:03:37,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,458 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107
[2024-11-07 10:03:37,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 10:03:37,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 10:03:37,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 10:03:37,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 10:03:37,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,495 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 10:03:37,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 10:03:37,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 10:03:37,526 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 10:03:37,526 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 10:03:37,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (1/1) ...
[2024-11-07 10:03:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 10:03:37,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 10:03:37,555 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 10:03:37,557 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 10:03:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 10:03:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 10:03:37,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 10:03:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 10:03:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 10:03:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 10:03:37,632 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 10:03:37,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 10:03:40,021 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-07 10:03:40,022 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 10:03:40,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 10:03:40,034 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 10:03:40,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:40 BoogieIcfgContainer
[2024-11-07 10:03:40,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 10:03:40,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 10:03:40,036 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 10:03:40,040 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 10:03:40,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:03:37" (1/3) ...
[2024-11-07 10:03:40,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fbef8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:40, skipping insertion in model container
[2024-11-07 10:03:40,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:03:37" (2/3) ...
[2024-11-07 10:03:40,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fbef8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:03:40, skipping insertion in model container
[2024-11-07 10:03:40,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:03:40" (3/3) ...
[2024-11-07 10:03:40,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-55.i
[2024-11-07 10:03:40,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 10:03:40,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 10:03:40,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 10:03:40,097 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;@3220fa27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 10:03:40,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 10:03:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-07 10:03:40,105 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:40,105 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:40,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:40,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash 620519901, now seen corresponding path program 1 times
[2024-11-07 10:03:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 10:03:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672921406]
[2024-11-07 10:03:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:40,116 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 10:03:40,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 10:03:40,120 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 10:03:40,121 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 10:03:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:40,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 10:03:40,417 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 10:03:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2024-11-07 10:03:40,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 10:03:40,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 10:03:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672921406]
[2024-11-07 10:03:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672921406] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:40,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 10:03:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653520333]
[2024-11-07 10:03:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:40,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 10:03:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 10:03:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 10:03:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 10:03:40,461 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2024-11-07 10:03:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:40,476 INFO L93 Difference]: Finished difference Result 85 states and 138 transitions.
[2024-11-07 10:03:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 10:03:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81
[2024-11-07 10:03:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:40,483 INFO L225 Difference]: With dead ends: 85
[2024-11-07 10:03:40,484 INFO L226 Difference]: Without dead ends: 42
[2024-11-07 10:03:40,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 10:03:40,490 INFO L432 NwaCegarLoop]: 59 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, 59 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 10:03:40,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 10:03:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2024-11-07 10:03:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2024-11-07 10:03:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions.
[2024-11-07 10:03:40,521 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 81
[2024-11-07 10:03:40,521 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:40,521 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions.
[2024-11-07 10:03:40,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2024-11-07 10:03:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions.
[2024-11-07 10:03:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-07 10:03:40,526 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:40,526 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:40,538 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 10:03:40,727 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 10:03:40,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1532144597, now seen corresponding path program 1 times
[2024-11-07 10:03:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 10:03:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248366006]
[2024-11-07 10:03:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:40,730 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 10:03:40,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 10:03:40,733 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 10:03:40,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 10:03:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:41,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 10:03:41,026 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 10:03:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-11-07 10:03:41,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 10:03:41,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 10:03:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248366006]
[2024-11-07 10:03:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248366006] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 10:03:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 10:03:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 10:03:41,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868063245]
[2024-11-07 10:03:41,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 10:03:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 10:03:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 10:03:41,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 10:03:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 10:03:41,063 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:43,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 10:03:45,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 10:03:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 10:03:45,586 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions.
[2024-11-07 10:03:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 10:03:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81
[2024-11-07 10:03:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 10:03:45,616 INFO L225 Difference]: With dead ends: 93
[2024-11-07 10:03:45,616 INFO L226 Difference]: Without dead ends: 54
[2024-11-07 10:03:45,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 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 10:03:45,617 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time
[2024-11-07 10:03:45,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time]
[2024-11-07 10:03:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2024-11-07 10:03:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43.
[2024-11-07 10:03:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2024-11-07 10:03:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions.
[2024-11-07 10:03:45,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 81
[2024-11-07 10:03:45,624 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 10:03:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions.
[2024-11-07 10:03:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2024-11-07 10:03:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions.
[2024-11-07 10:03:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-07 10:03:45,626 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 10:03:45,626 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:45,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 10:03:45,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 10:03:45,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 10:03:45,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 10:03:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -987815337, now seen corresponding path program 1 times
[2024-11-07 10:03:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 10:03:45,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147493262]
[2024-11-07 10:03:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 10:03:45,828 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 10:03:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 10:03:45,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 10:03:45,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 10:03:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 10:03:46,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-07 10:03:46,112 INFO L278 TraceCheckSpWp]: Computing forward predicates...