./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.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', '493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.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 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:57:58,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:57:58,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:57:58,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:57:58,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:57:58,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:57:58,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:57:58,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:57:58,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:57:58,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:57:58,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:57:58,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:57:58,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:57:58,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:57:58,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:57:58,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:57:58,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:57:58,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:57:58,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:57:58,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:57:58,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:57:58,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:57:58,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:57:58,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:57:58,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:57:58,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:57:58,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:57:58,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:57:58,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:57:58,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:57:58,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:57:58,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:57:58,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:57:58,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:57:58,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:57:58,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:57:58,441 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 -> 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce [2024-11-07 09:57:58,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:57:58,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:57:58,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:57:58,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:57:58,721 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:57:58,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-11-07 09:58:00,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:58:00,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:58:00,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-11-07 09:58:00,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a78f1317/93938bedfb914b05b7020905c79debb3/FLAG01b984149 [2024-11-07 09:58:00,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a78f1317/93938bedfb914b05b7020905c79debb3 [2024-11-07 09:58:00,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:58:00,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:58:00,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:00,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:58:00,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:58:00,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd4f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00, skipping insertion in model container [2024-11-07 09:58:00,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:58:00,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-11-07 09:58:00,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:00,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:58:00,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-11-07 09:58:00,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:00,668 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:58:00,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00 WrapperNode [2024-11-07 09:58:00,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:00,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:00,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:58:00,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:58:00,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,718 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-07 09:58:00,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:00,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:58:00,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:58:00,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:58:00,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,751 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 09:58:00,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:58:00,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:58:00,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:58:00,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:58:00,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (1/1) ... [2024-11-07 09:58:00,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:00,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:58:00,808 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 09:58:00,815 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 09:58:00,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:58:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:58:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:58:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:58:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:58:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:58:00,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:58:00,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:58:01,184 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:58:01,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:58:01,195 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:58:01,197 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:58:01,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:01 BoogieIcfgContainer [2024-11-07 09:58:01,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:58:01,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:58:01,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:58:01,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:58:01,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:58:00" (1/3) ... [2024-11-07 09:58:01,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca1b2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:01, skipping insertion in model container [2024-11-07 09:58:01,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:00" (2/3) ... [2024-11-07 09:58:01,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca1b2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:01, skipping insertion in model container [2024-11-07 09:58:01,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:01" (3/3) ... [2024-11-07 09:58:01,209 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-11.i [2024-11-07 09:58:01,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:58:01,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:58:01,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:58:01,298 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;@7252425f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:58:01,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:58:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:58:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:58:01,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:01,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:01,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:01,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash 269086274, now seen corresponding path program 1 times [2024-11-07 09:58:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723328154] [2024-11-07 09:58:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:58:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:58:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:58:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:58:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:58:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:58:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 09:58:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:58:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 09:58:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:58:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 09:58:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:58:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 09:58:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 09:58:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 09:58:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 09:58:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:58:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:58:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723328154] [2024-11-07 09:58:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723328154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:01,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:58:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442929636] [2024-11-07 09:58:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:58:01,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:58:01,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:58:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:01,666 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:58:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:01,684 INFO L93 Difference]: Finished difference Result 101 states and 170 transitions. [2024-11-07 09:58:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:58:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-07 09:58:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:01,694 INFO L225 Difference]: With dead ends: 101 [2024-11-07 09:58:01,694 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 09:58:01,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:01,701 INFO L432 NwaCegarLoop]: 73 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, 73 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 09:58:01,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 09:58:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 09:58:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:58:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-07 09:58:01,750 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 104 [2024-11-07 09:58:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:01,752 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-07 09:58:01,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:58:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-07 09:58:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:58:01,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:01,756 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:01,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:58:01,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:01,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash 800021186, now seen corresponding path program 1 times [2024-11-07 09:58:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576111010] [2024-11-07 09:58:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:58:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 09:58:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 09:58:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 09:58:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 09:58:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 09:58:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 09:58:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 09:58:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 09:58:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:58:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 09:58:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:58:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 09:58:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 09:58:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 09:58:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 09:58:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:58:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:58:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576111010] [2024-11-07 09:58:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576111010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:58:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963038837] [2024-11-07 09:58:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:02,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:58:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:58:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:58:02,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:02,272 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:58:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:02,330 INFO L93 Difference]: Finished difference Result 144 states and 213 transitions. [2024-11-07 09:58:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:58:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 09:58:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:02,333 INFO L225 Difference]: With dead ends: 144 [2024-11-07 09:58:02,333 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 09:58:02,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:02,334 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:02,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 129 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 09:58:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-07 09:58:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 09:58:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-11-07 09:58:02,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 104 [2024-11-07 09:58:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:02,360 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-11-07 09:58:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:58:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-11-07 09:58:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:58:02,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:02,362 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:02,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:58:02,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:02,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash 801868228, now seen corresponding path program 1 times [2024-11-07 09:58:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:58:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088111300] [2024-11-07 09:58:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:58:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:58:02,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:58:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:58:02,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:58:02,574 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:58:02,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:58:02,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:58:02,581 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 09:58:02,649 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:58:02,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:58:02 BoogieIcfgContainer [2024-11-07 09:58:02,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:58:02,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:58:02,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:58:02,655 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:58:02,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:01" (3/4) ... [2024-11-07 09:58:02,658 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:58:02,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:58:02,659 INFO L158 Benchmark]: Toolchain (without parser) took 2286.17ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 50.3MB in the end (delta: 41.4MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2024-11-07 09:58:02,660 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:02,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.77ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 78.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:58:02,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.81ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:02,662 INFO L158 Benchmark]: Boogie Preprocessor took 53.78ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 71.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:02,662 INFO L158 Benchmark]: RCFGBuilder took 423.87ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 55.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 09:58:02,662 INFO L158 Benchmark]: TraceAbstraction took 1452.55ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 50.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-07 09:58:02,663 INFO L158 Benchmark]: Witness Printer took 5.98ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:58:02,664 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.29ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.77ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 78.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.81ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.78ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 71.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 423.87ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 55.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1452.55ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 50.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 5.98ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] double var_1_3 = 7.675; [L25] signed char var_1_7 = 10; [L26] float var_1_8 = 32.5; [L27] float var_1_9 = 1000000.7; [L28] float var_1_10 = 2.4; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 200; [L34] unsigned char var_1_16 = 10; [L35] unsigned char var_1_17 = 1; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=203/4, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_2=203/4, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_3=307/40, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] var_1_3 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L73] var_1_7 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2, var_1_9=10000007/10] [L75] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2, var_1_9=10000007/10] [L75] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2, var_1_9=10000007/10] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=12/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L78] var_1_10 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L79] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L80] var_1_12 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=200, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L86] var_1_15 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L87] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L88] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=10, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L89] var_1_16 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L90] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L91] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=1, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L92] var_1_17 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L93] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L94] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L94] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L108] RET updateVariables() [L109] CALL step() [L40] COND FALSE !(var_1_3 >= var_1_2) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L49] COND FALSE !(var_1_8 <= var_1_8) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L52] unsigned char stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L53] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=5, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L62] COND FALSE !(! var_1_11) [L65] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-250, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return (((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_11 && var_1_11) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((var_1_3 >= var_1_2) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? (var_1_8 == ((float) ((((var_1_9) > ((10.25f + var_1_10))) ? (var_1_9) : ((10.25f + var_1_10)))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && ((var_1_8 <= var_1_8) ? (var_1_11 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && ((! var_1_11) ? (var_1_14 == ((unsigned char) ((((((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) < (var_1_17)) ? (((((var_1_15) < (((((var_1_16) > (5)) ? (var_1_16) : (5))))) ? (var_1_15) : (((((var_1_16) > (5)) ? (var_1_16) : (5))))))) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_16))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-250, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-250, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-250, var_1_15=6, var_1_16=-250, var_1_17=254, var_1_1=-16, var_1_7=126, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 140 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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 09:58:02,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.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 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:58:04,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:58:04,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:58:04,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:58:04,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:58:04,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:58:04,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:58:04,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:58:04,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:58:04,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:58:04,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:58:04,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:58:04,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:58:04,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:58:04,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:58:04,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:58:04,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:58:04,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:58:04,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:58:04,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:58:04,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:58:04,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:58:04,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:58:04,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:58:04,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:58:04,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:58:04,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:58:04,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:04,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:58:04,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:58:04,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:58:04,992 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 -> 493c4a8c013a7a4203725139ad68ff56674f93b6f02b61f7e89a20a5fce278ce [2024-11-07 09:58:05,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:58:05,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:58:05,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:58:05,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:58:05,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:58:05,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-11-07 09:58:06,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:58:06,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:58:06,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i [2024-11-07 09:58:06,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d602552d/91aae6daadc64b178a4d3623dd42e43c/FLAG401fafed3 [2024-11-07 09:58:07,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d602552d/91aae6daadc64b178a4d3623dd42e43c [2024-11-07 09:58:07,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:58:07,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:58:07,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:07,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:58:07,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:58:07,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6687432d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07, skipping insertion in model container [2024-11-07 09:58:07,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:58:07,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-11-07 09:58:07,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:07,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:58:07,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-11.i[913,926] [2024-11-07 09:58:07,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:58:07,531 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:58:07,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07 WrapperNode [2024-11-07 09:58:07,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:58:07,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:07,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:58:07,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:58:07,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,569 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-07 09:58:07,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:58:07,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:58:07,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:58:07,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:58:07,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,607 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 09:58:07,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:58:07,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:58:07,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:58:07,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:58:07,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (1/1) ... [2024-11-07 09:58:07,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:58:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:58:07,688 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 09:58:07,695 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 09:58:07,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:58:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:58:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:58:07,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:58:07,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:58:07,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:58:07,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:58:07,806 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:58:19,523 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 09:58:19,523 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:58:19,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:58:19,534 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:58:19,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:19 BoogieIcfgContainer [2024-11-07 09:58:19,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:58:19,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:58:19,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:58:19,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:58:19,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:58:07" (1/3) ... [2024-11-07 09:58:19,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb779df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:19, skipping insertion in model container [2024-11-07 09:58:19,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:07" (2/3) ... [2024-11-07 09:58:19,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb779df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:19, skipping insertion in model container [2024-11-07 09:58:19,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:19" (3/3) ... [2024-11-07 09:58:19,545 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-11.i [2024-11-07 09:58:19,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:58:19,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:58:19,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:58:19,620 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;@38ca083d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:58:19,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:58:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:58:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:58:19,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:19,635 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:19,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:19,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash 269086274, now seen corresponding path program 1 times [2024-11-07 09:58:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486073034] [2024-11-07 09:58:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:19,651 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 09:58:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:19,654 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 09:58:19,656 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 09:58:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:20,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:58:20,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:58:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-07 09:58:20,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:58:20,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:58:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486073034] [2024-11-07 09:58:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486073034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:20,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:58:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684828743] [2024-11-07 09:58:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:20,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:58:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:58:20,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:58:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:58:20,197 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:58:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:20,214 INFO L93 Difference]: Finished difference Result 101 states and 170 transitions. [2024-11-07 09:58:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:58:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-07 09:58:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:20,220 INFO L225 Difference]: With dead ends: 101 [2024-11-07 09:58:20,220 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 09:58:20,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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 09:58:20,225 INFO L432 NwaCegarLoop]: 72 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, 72 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 09:58:20,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:58:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 09:58:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-07 09:58:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:58:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-07 09:58:20,259 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 104 [2024-11-07 09:58:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:20,259 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-07 09:58:20,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 09:58:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-07 09:58:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:58:20,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:20,262 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:20,280 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 09:58:20,466 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 09:58:20,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:20,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash 800021186, now seen corresponding path program 1 times [2024-11-07 09:58:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:20,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834199850] [2024-11-07 09:58:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:20,469 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 09:58:20,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:20,474 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 09:58:20,475 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 09:58:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:20,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 09:58:20,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:58:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 09:58:23,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:58:23,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:58:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834199850] [2024-11-07 09:58:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834199850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:58:23,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:58:23,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:58:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305985544] [2024-11-07 09:58:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:58:23,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:58:23,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:58:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:58:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:58:23,124 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:58:27,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 09:58:31,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 09:58:35,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 09:58:40,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 09:58:41,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 09:58:46,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 09:58:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:58:46,315 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2024-11-07 09:58:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:58:46,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-07 09:58:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:58:46,318 INFO L225 Difference]: With dead ends: 144 [2024-11-07 09:58:46,318 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 09:58:46,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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 09:58:46,320 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2024-11-07 09:58:46,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 131 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 23.2s Time] [2024-11-07 09:58:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 09:58:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-11-07 09:58:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 09:58:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-07 09:58:46,338 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 104 [2024-11-07 09:58:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:58:46,338 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-07 09:58:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 09:58:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-07 09:58:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:58:46,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:58:46,341 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:58:46,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 09:58:46,541 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 09:58:46,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:58:46,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:58:46,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1609367812, now seen corresponding path program 1 times [2024-11-07 09:58:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:58:46,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71591944] [2024-11-07 09:58:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:58:46,544 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 09:58:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:58:46,546 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 09:58:46,548 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 09:58:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:58:47,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 09:58:47,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:58:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 255 proven. 21 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-07 09:58:48,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 09:58:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 09:58:49,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:58:49,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71591944] [2024-11-07 09:58:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71591944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 09:58:49,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 09:58:49,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-07 09:58:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149021589] [2024-11-07 09:58:49,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 09:58:49,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 09:58:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:58:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 09:58:49,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:58:49,920 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 09:58:55,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:58:59,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 09:59:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:59:00,533 INFO L93 Difference]: Finished difference Result 197 states and 281 transitions. [2024-11-07 09:59:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 09:59:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 104 [2024-11-07 09:59:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:59:00,605 INFO L225 Difference]: With dead ends: 197 [2024-11-07 09:59:00,605 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 09:59:00,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-07 09:59:00,607 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 165 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 119 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:59:00,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 106 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 104 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2024-11-07 09:59:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 09:59:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-07 09:59:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 09:59:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-11-07 09:59:00,635 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 104 [2024-11-07 09:59:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:59:00,636 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-11-07 09:59:00,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 09:59:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-11-07 09:59:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 09:59:00,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:59:00,638 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:59:00,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 09:59:00,838 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 09:59:00,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:59:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:59:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1611214854, now seen corresponding path program 1 times [2024-11-07 09:59:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:59:00,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482798877] [2024-11-07 09:59:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:59:00,843 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 09:59:00,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:59:00,848 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 09:59:00,850 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 09:59:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:59:01,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 09:59:01,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:59:11,157 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 09:59:19,389 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 09:59:27,555 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 09:59:35,816 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 09:59:39,881 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv1 8) c_~var_1_11~0) (not (fp.geq c_~var_1_3~0 c_~var_1_2~0)) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false