./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.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', '0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.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 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:42:11,261 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:42:11,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 08:42:11,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:42:11,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:42:11,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:42:11,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:42:11,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:42:11,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:42:11,376 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:42:11,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:42:11,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:42:11,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:42:11,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:42:11,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:42:11,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:42:11,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:42:11,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:42:11,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:42:11,379 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 -> 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d
[2024-11-07 08:42:11,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:42:11,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:42:11,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:42:11,629 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:42:11,629 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:42:11,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i
[2024-11-07 08:42:12,817 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:42:12,997 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:42:12,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i
[2024-11-07 08:42:13,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b467c36b8/9f5e3d16f73545e3b783592130f698ad/FLAG76bd2a21d
[2024-11-07 08:42:13,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b467c36b8/9f5e3d16f73545e3b783592130f698ad
[2024-11-07 08:42:13,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:42:13,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:42:13,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:42:13,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:42:13,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:42:13,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba4e244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13, skipping insertion in model container
[2024-11-07 08:42:13,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,405 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:42:13,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_loopvsstraightlinecode_50-1loop_file-40.i[915,928]
[2024-11-07 08:42:13,529 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:42:13,544 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:42:13,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i[915,928]
[2024-11-07 08:42:13,568 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:42:13,582 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:42:13,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13 WrapperNode
[2024-11-07 08:42:13,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:42:13,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:42:13,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:42:13,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:42:13,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,633 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114
[2024-11-07 08:42:13,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:42:13,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:42:13,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:42:13,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:42:13,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,662 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 08:42:13,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:42:13,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:42:13,681 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:42:13,681 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:42:13,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (1/1) ...
[2024-11-07 08:42:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:42:13,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:42:13,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 08:42:13,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 08:42:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:42:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:42:13,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:42:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:42:13,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:42:13,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:42:13,798 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:42:13,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:42:14,065 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-07 08:42:14,066 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:42:14,075 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:42:14,076 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:42:14,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:14 BoogieIcfgContainer
[2024-11-07 08:42:14,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:42:14,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:42:14,078 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:42:14,081 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:42:14,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:42:13" (1/3) ...
[2024-11-07 08:42:14,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558435f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:14, skipping insertion in model container
[2024-11-07 08:42:14,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:13" (2/3) ...
[2024-11-07 08:42:14,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558435f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:14, skipping insertion in model container
[2024-11-07 08:42:14,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:14" (3/3) ...
[2024-11-07 08:42:14,084 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-40.i
[2024-11-07 08:42:14,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:42:14,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:42:14,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:42:14,166 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;@7bd7720c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:42:14,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:42:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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 08:42:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2024-11-07 08:42:14,175 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:14,176 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]
[2024-11-07 08:42:14,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 775977129, now seen corresponding path program 1 times
[2024-11-07 08:42:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:42:14,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145813862]
[2024-11-07 08:42:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:42:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:42:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:42:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 08:42:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:42:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 08:42:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:42:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 08:42:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:42:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 08:42:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:42:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 08:42:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:42:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,404 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 08:42:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:42:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145813862]
[2024-11-07 08:42:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145813862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:42:14,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:42:14,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:42:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115542119]
[2024-11-07 08:42:14,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:42:14,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:42:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:42:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:42:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:42:14,426 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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), 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 08:42:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:42:14,445 INFO L93 Difference]: Finished difference Result 99 states and 157 transitions.
[2024-11-07 08:42:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:42:14,447 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), 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 85
[2024-11-07 08:42:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:42:14,452 INFO L225 Difference]: With dead ends: 99
[2024-11-07 08:42:14,452 INFO L226 Difference]: Without dead ends: 47
[2024-11-07 08:42:14,456 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 08:42:14,458 INFO L432 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:42:14,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:42:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-07 08:42:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2024-11-07 08:42:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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 08:42:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions.
[2024-11-07 08:42:14,491 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 85
[2024-11-07 08:42:14,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:42:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions.
[2024-11-07 08:42:14,491 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), 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 08:42:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions.
[2024-11-07 08:42:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:42:14,494 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:14,494 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 08:42:14,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:42:14,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1913866013, now seen corresponding path program 1 times
[2024-11-07 08:42:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:42:14,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543267230]
[2024-11-07 08:42:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:42:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:42:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:42:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 08:42:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:42:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 08:42:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:42:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 08:42:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:42:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 08:42:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:42:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 08:42:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:42:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:14,788 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 08:42:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:42:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543267230]
[2024-11-07 08:42:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543267230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:42:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:42:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:42:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400232587]
[2024-11-07 08:42:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:42:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:42:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:42:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:42:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:42:14,792 INFO L87 Difference]: Start difference. First operand 47 states and 66 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 08:42:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:42:14,814 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions.
[2024-11-07 08:42:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:42:14,815 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 08:42:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:42:14,820 INFO L225 Difference]: With dead ends: 91
[2024-11-07 08:42:14,820 INFO L226 Difference]: Without dead ends: 47
[2024-11-07 08:42:14,820 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 08:42:14,821 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:42:14,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:42:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-07 08:42:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2024-11-07 08:42:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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 08:42:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions.
[2024-11-07 08:42:14,830 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 86
[2024-11-07 08:42:14,831 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:42:14,832 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions.
[2024-11-07 08:42:14,832 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 08:42:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions.
[2024-11-07 08:42:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:42:14,833 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:14,834 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 08:42:14,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:42:14,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1571754657, now seen corresponding path program 1 times
[2024-11-07 08:42:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:42:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403795336]
[2024-11-07 08:42:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:42:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:42:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:42:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-07 08:42:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:42:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-07 08:42:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:42:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-07 08:42:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:42:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-07 08:42:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:42:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 08:42:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:42:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:15,278 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 08:42:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:42:15,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403795336]
[2024-11-07 08:42:15,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403795336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:42:15,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:42:15,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 08:42:15,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052369763]
[2024-11-07 08:42:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:42:15,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 08:42:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:42:15,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 08:42:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 08:42:15,281 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 08:42:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:42:15,690 INFO L93 Difference]: Finished difference Result 173 states and 238 transitions.
[2024-11-07 08:42:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 08:42:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 08:42:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:42:15,692 INFO L225 Difference]: With dead ends: 173
[2024-11-07 08:42:15,692 INFO L226 Difference]: Without dead ends: 129
[2024-11-07 08:42:15,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 08:42:15,693 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 145 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:42:15,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 208 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:42:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2024-11-07 08:42:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81.
[2024-11-07 08:42:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21)
[2024-11-07 08:42:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions.
[2024-11-07 08:42:15,717 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 86
[2024-11-07 08:42:15,717 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:42:15,717 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions.
[2024-11-07 08:42:15,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 08:42:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions.
[2024-11-07 08:42:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:42:15,718 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:15,719 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 08:42:15,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:42:15,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:15,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1573601699, now seen corresponding path program 1 times
[2024-11-07 08:42:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:42:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664906954]
[2024-11-07 08:42:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:42:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 08:42:15,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106469515]
[2024-11-07 08:42:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:42:15,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:42:15,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 08:42:15,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 08:42:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:42:15,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:42:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:42:15,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:42:15,990 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:42:15,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:42:16,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 08:42:16,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:42:16,195 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-11-07 08:42:16,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:42:16,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:42:16 BoogieIcfgContainer
[2024-11-07 08:42:16,252 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:42:16,252 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:42:16,252 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:42:16,252 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:42:16,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:14" (3/4) ...
[2024-11-07 08:42:16,255 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:42:16,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:42:16,256 INFO L158 Benchmark]: Toolchain (without parser) took 2868.76ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 91.0MB in the beginning and 62.4MB in the end (delta: 28.7MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB.
[2024-11-07 08:42:16,256 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:42:16,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.16ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 77.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:42:16,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.11ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 73.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:42:16,258 INFO L158 Benchmark]: Boogie Preprocessor took 45.47ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 67.4MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:42:16,258 INFO L158 Benchmark]: RCFGBuilder took 395.61ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 47.4MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 08:42:16,260 INFO L158 Benchmark]: TraceAbstraction took 2174.09ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 46.9MB in the beginning and 62.4MB in the end (delta: -15.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-07 08:42:16,260 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 151.0MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:42:16,261 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.17ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 195.16ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 77.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 50.11ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 73.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 45.47ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 67.4MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 395.61ms. Allocated memory is still 117.4MB. Free memory was 67.4MB in the beginning and 47.4MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 2174.09ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 46.9MB in the beginning and 62.4MB in the end (delta: -15.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Witness Printer took 3.04ms. Allocated memory is still 151.0MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.8kB). 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 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 35.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 128;
[L23] signed short int var_1_4 = -200;
[L24] unsigned short int var_1_8 = 5;
[L25] unsigned char var_1_9 = 1;
[L26] unsigned char var_1_10 = 0;
[L27] unsigned char var_1_11 = 0;
[L28] unsigned char var_1_12 = 16;
[L29] unsigned char var_1_15 = 50;
[L30] unsigned short int var_1_16 = 1;
[L31] float var_1_17 = 25.4;
[L32] float var_1_20 = 1.6;
[L33] unsigned short int var_1_21 = 0;
[L34] float var_1_24 = 128.5;
[L35] double var_1_25 = -0.5;
[L36] signed long int var_1_26 = 4;
[L37] unsigned char last_1_var_1_9 = 1;
[L38] float last_1_var_1_24 = 128.5;
VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1]
[L110] isInitial = 1
[L111] FCALL initially()
[L112] int k_loop;
[L113] k_loop = 0
VAL [isInitial=1, k_loop=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1]
[L113] COND TRUE k_loop < 1
[L114] CALL updateLastVariables()
[L102] last_1_var_1_9 = var_1_9
[L103] last_1_var_1_24 = var_1_24
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1]
[L114] RET updateLastVariables()
[L115] CALL updateVariables()
[L82] var_1_4 = __VERIFIER_nondet_short()
[L83] CALL assume_abort_if_not(var_1_4 >= -32768)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L83] RET assume_abort_if_not(var_1_4 >= -32768)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L84] CALL assume_abort_if_not(var_1_4 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L84] RET assume_abort_if_not(var_1_4 <= 32767)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L85] CALL assume_abort_if_not(var_1_4 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L85] RET assume_abort_if_not(var_1_4 != 0)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=5, var_1_9=1]
[L86] var_1_8 = __VERIFIER_nondet_ushort()
[L87] CALL assume_abort_if_not(var_1_8 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_9=1]
[L87] RET assume_abort_if_not(var_1_8 >= 0)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_9=1]
[L88] CALL assume_abort_if_not(var_1_8 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L88] RET assume_abort_if_not(var_1_8 <= 32767)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L89] var_1_10 = __VERIFIER_nondet_uchar()
[L90] CALL assume_abort_if_not(var_1_10 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L90] RET assume_abort_if_not(var_1_10 >= 0)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L91] CALL assume_abort_if_not(var_1_10 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L91] RET assume_abort_if_not(var_1_10 <= 1)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L92] var_1_11 = __VERIFIER_nondet_uchar()
[L93] CALL assume_abort_if_not(var_1_11 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L93] RET assume_abort_if_not(var_1_11 >= 0)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L94] CALL assume_abort_if_not(var_1_11 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L94] RET assume_abort_if_not(var_1_11 <= 0)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L95] var_1_15 = __VERIFIER_nondet_uchar()
[L96] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L96] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L97] CALL assume_abort_if_not(var_1_15 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L97] RET assume_abort_if_not(var_1_15 <= 254)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L98] var_1_20 = __VERIFIER_nondet_float()
[L99] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L99] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L115] RET updateVariables()
[L116] CALL step()
[L42] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8))
[L49] var_1_12 = var_1_15
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L51] unsigned char stepLocal_1 = var_1_10;
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=1]
[L52] COND TRUE (var_1_12 != var_1_4) || stepLocal_1
[L53] var_1_9 = var_1_11
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=2, var_1_8=0, var_1_9=0]
[L55] var_1_26 = var_1_12
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L56] COND FALSE !((var_1_9 && var_1_11) && var_1_9)
[L59] var_1_21 = ((23370 - var_1_15) + var_1_12)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L61] signed long int stepLocal_2 = -4;
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L62] COND FALSE !(! (-4 < var_1_12))
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L65] COND FALSE !(stepLocal_2 > var_1_21)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L69] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))
[L70] var_1_25 = var_1_20
[L71] unsigned short int stepLocal_0 = var_1_16;
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L72] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0
[L73] var_1_1 = var_1_12
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L77] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16))
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L116] RET step()
[L117] CALL, EXPR property()
[L106-L107] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12))
;
VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L117] RET, EXPR property()
[L117] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=258, var_1_15=258, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_4=2, var_1_8=0, var_1_9=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 215 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-07 08:42:16,276 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_loopvsstraightlinecode_50-1loop_file-40.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 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:42:18,187 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:42:18,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 08:42:18,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:42:18,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:42:18,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:42:18,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:42:18,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:42:18,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:42:18,295 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:42:18,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:42:18,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:42:18,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:42:18,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:42:18,296 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:42:18,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:42:18,297 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:42:18,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:42:18,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:42:18,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:42:18,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:42:18,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:42:18,299 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:42:18,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:42:18,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:42:18,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:42:18,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:42:18,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:42:18,300 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 -> 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d
[2024-11-07 08:42:18,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:42:18,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:42:18,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:42:18,546 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:42:18,546 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:42:18,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i
[2024-11-07 08:42:19,702 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:42:19,912 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:42:19,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i
[2024-11-07 08:42:19,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77db885da/5a46e6342a2d4572b4a6d111878fb7b6/FLAG71320f190
[2024-11-07 08:42:19,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77db885da/5a46e6342a2d4572b4a6d111878fb7b6
[2024-11-07 08:42:19,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:42:19,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:42:19,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:42:19,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:42:19,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:42:19,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:19" (1/1) ...
[2024-11-07 08:42:19,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ba4615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:19, skipping insertion in model container
[2024-11-07 08:42:19,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:42:19" (1/1) ...
[2024-11-07 08:42:19,968 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:42:20,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i[915,928]
[2024-11-07 08:42:20,132 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:42:20,147 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:42:20,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i[915,928]
[2024-11-07 08:42:20,179 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:42:20,190 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:42:20,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20 WrapperNode
[2024-11-07 08:42:20,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:42:20,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:42:20,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:42:20,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:42:20,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,239 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113
[2024-11-07 08:42:20,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:42:20,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:42:20,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:42:20,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:42:20,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,261 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 08:42:20,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:42:20,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:42:20,279 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:42:20,279 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:42:20,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (1/1) ...
[2024-11-07 08:42:20,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:42:20,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:42:20,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 08:42:20,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 08:42:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:42:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:42:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:42:20,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:42:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:42:20,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:42:20,405 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:42:20,407 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:42:20,881 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2024-11-07 08:42:20,881 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:42:20,888 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:42:20,888 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:42:20,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:20 BoogieIcfgContainer
[2024-11-07 08:42:20,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:42:20,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:42:20,890 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:42:20,894 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:42:20,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:42:19" (1/3) ...
[2024-11-07 08:42:20,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7df1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:20, skipping insertion in model container
[2024-11-07 08:42:20,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:42:20" (2/3) ...
[2024-11-07 08:42:20,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7df1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:42:20, skipping insertion in model container
[2024-11-07 08:42:20,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:42:20" (3/3) ...
[2024-11-07 08:42:20,897 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-40.i
[2024-11-07 08:42:20,908 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:42:20,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:42:20,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:42:20,974 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;@65d4d6d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:42:20,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:42:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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 08:42:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2024-11-07 08:42:20,985 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:20,985 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]
[2024-11-07 08:42:20,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash 775977129, now seen corresponding path program 1 times
[2024-11-07 08:42:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:42:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566276545]
[2024-11-07 08:42:21,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:21,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:42:21,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:42:21,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-07 08:42:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:21,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:42:21,189 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:42:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked.
[2024-11-07 08:42:21,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:42:21,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:42:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566276545]
[2024-11-07 08:42:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566276545] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:42:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:42:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:42:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930463766]
[2024-11-07 08:42:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:42:21,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:42:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:42:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:42:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:42:21,243 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 08:42:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:42:21,261 INFO L93 Difference]: Finished difference Result 99 states and 157 transitions.
[2024-11-07 08:42:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:42:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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 85
[2024-11-07 08:42:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:42:21,269 INFO L225 Difference]: With dead ends: 99
[2024-11-07 08:42:21,269 INFO L226 Difference]: Without dead ends: 47
[2024-11-07 08:42:21,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:42:21,274 INFO L432 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:42:21,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:42:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-07 08:42:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2024-11-07 08:42:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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 08:42:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions.
[2024-11-07 08:42:21,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 85
[2024-11-07 08:42:21,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:42:21,305 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions.
[2024-11-07 08:42:21,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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 08:42:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions.
[2024-11-07 08:42:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:42:21,307 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:21,307 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 08:42:21,315 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 08:42:21,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:21,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:21,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1913866013, now seen corresponding path program 1 times
[2024-11-07 08:42:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:42:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698228082]
[2024-11-07 08:42:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:42:21,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:42:21,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 08:42:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:21,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 08:42:21,679 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:42:21,740 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 08:42:21,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:42:21,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:42:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698228082]
[2024-11-07 08:42:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698228082] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:42:21,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:42:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 08:42:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010961424]
[2024-11-07 08:42:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:42:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 08:42:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:42:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 08:42:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:42:21,742 INFO L87 Difference]: Start difference. First operand 47 states and 66 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 08:42:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:42:21,932 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions.
[2024-11-07 08:42:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 08:42:21,941 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 08:42:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:42:21,942 INFO L225 Difference]: With dead ends: 91
[2024-11-07 08:42:21,942 INFO L226 Difference]: Without dead ends: 47
[2024-11-07 08:42:21,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 08:42:21,943 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:42:21,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:42:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-07 08:42:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2024-11-07 08:42:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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 08:42:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions.
[2024-11-07 08:42:21,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 86
[2024-11-07 08:42:21,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:42:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions.
[2024-11-07 08:42:21,950 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 08:42:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions.
[2024-11-07 08:42:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:42:21,953 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:21,953 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 08:42:21,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-07 08:42:22,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:22,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1571754657, now seen corresponding path program 1 times
[2024-11-07 08:42:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:42:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738013503]
[2024-11-07 08:42:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:22,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:42:22,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:42:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 08:42:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:22,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 08:42:22,321 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:42:22,498 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 08:42:22,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:42:22,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:42:22,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738013503]
[2024-11-07 08:42:22,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738013503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:42:22,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:42:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 08:42:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554856828]
[2024-11-07 08:42:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:42:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:42:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:42:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:42:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:42:22,500 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 08:42:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:42:23,486 INFO L93 Difference]: Finished difference Result 194 states and 265 transitions.
[2024-11-07 08:42:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 08:42:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 08:42:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:42:23,490 INFO L225 Difference]: With dead ends: 194
[2024-11-07 08:42:23,490 INFO L226 Difference]: Without dead ends: 150
[2024-11-07 08:42:23,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:42:23,491 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 122 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-07 08:42:23,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 274 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-07 08:42:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2024-11-07 08:42:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 90.
[2024-11-07 08:42:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-07 08:42:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions.
[2024-11-07 08:42:23,504 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 86
[2024-11-07 08:42:23,505 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:42:23,505 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions.
[2024-11-07 08:42:23,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 08:42:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions.
[2024-11-07 08:42:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:42:23,506 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:42:23,506 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 08:42:23,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2024-11-07 08:42:23,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:23,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:42:23,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:42:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1573601699, now seen corresponding path program 1 times
[2024-11-07 08:42:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:42:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015359894]
[2024-11-07 08:42:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:42:23,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:42:23,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:42:23,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:42:23,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-07 08:42:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:42:23,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-07 08:42:23,880 INFO L278 TraceCheckSpWp]: Computing forward predicates...