./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:03:59,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:03:59,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:03:59,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:03:59,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:03:59,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:03:59,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:03:59,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:03:59,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:03:59,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:03:59,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:03:59,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:03:59,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:03:59,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:03:59,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:03:59,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:03:59,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:03:59,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:03:59,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:03:59,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:03:59,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:03:59,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:03:59,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:03:59,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:03:59,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:03:59,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:03:59,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:03:59,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:03:59,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:03:59,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:03:59,581 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/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 -> 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 [2025-03-17 06:03:59,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:03:59,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:03:59,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:03:59,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:03:59,952 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:03:59,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2025-03-17 06:04:01,283 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa3a0da4/08e1275aad614bf4a983a3811114b33e/FLAGd188d6a5b [2025-03-17 06:04:01,524 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:04:01,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2025-03-17 06:04:01,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa3a0da4/08e1275aad614bf4a983a3811114b33e/FLAGd188d6a5b [2025-03-17 06:04:01,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa3a0da4/08e1275aad614bf4a983a3811114b33e [2025-03-17 06:04:01,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:04:01,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:04:01,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:01,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:04:01,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:04:01,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01, skipping insertion in model container [2025-03-17 06:04:01,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:04:01,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i[916,929] [2025-03-17 06:04:01,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:01,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:04:01,827 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i[916,929] [2025-03-17 06:04:01,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:01,894 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:04:01,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01 WrapperNode [2025-03-17 06:04:01,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:01,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:01,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:04:01,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:04:01,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,952 INFO L138 Inliner]: procedures = 30, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2025-03-17 06:04:01,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:01,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:04:01,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:04:01,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:04:01,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,977 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:04:01,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:01,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:02,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:02,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:02,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:02,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:02,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:04:02,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:04:02,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:04:02,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:04:02,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (1/1) ... [2025-03-17 06:04:02,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:02,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:04:02,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:04:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:04:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:04:02,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:04:02,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:04:02,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:04:02,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:04:02,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:04:02,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:04:02,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~bitwise94#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~bitwise114#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2025-03-17 06:04:02,630 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-17 06:04:02,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:04:02,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:04:02,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:04:02,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:02 BoogieIcfgContainer [2025-03-17 06:04:02,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:04:02,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:04:02,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:04:02,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:04:02,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:04:01" (1/3) ... [2025-03-17 06:04:02,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475a185c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:02, skipping insertion in model container [2025-03-17 06:04:02,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:01" (2/3) ... [2025-03-17 06:04:02,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475a185c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:02, skipping insertion in model container [2025-03-17 06:04:02,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:02" (3/3) ... [2025-03-17 06:04:02,663 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-95.i [2025-03-17 06:04:02,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:04:02,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-95.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:04:02,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:04:02,743 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;@45860bf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:04:02,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:04:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 90 states have internal predecessors, (128), 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) [2025-03-17 06:04:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:04:02,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:02,759 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:02,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 514964383, now seen corresponding path program 1 times [2025-03-17 06:04:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237158009] [2025-03-17 06:04:02,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:02,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:04:02,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:04:02,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:02,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 06:04:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:03,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237158009] [2025-03-17 06:04:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237158009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:03,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608132721] [2025-03-17 06:04:03,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:03,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:03,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:04:03,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:04:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:04:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:04:03,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:03,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:03,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:04:03,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 06:04:03,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608132721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:03,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:04:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:04:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721965075] [2025-03-17 06:04:03,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:03,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:04:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:03,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:04:03,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:03,379 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 90 states have internal predecessors, (128), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:04:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:03,408 INFO L93 Difference]: Finished difference Result 213 states and 334 transitions. [2025-03-17 06:04:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:04:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 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 128 [2025-03-17 06:04:03,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:03,416 INFO L225 Difference]: With dead ends: 213 [2025-03-17 06:04:03,417 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 06:04:03,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:03,424 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:03,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 06:04:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 06:04:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 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) [2025-03-17 06:04:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2025-03-17 06:04:03,464 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 128 [2025-03-17 06:04:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:03,465 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2025-03-17 06:04:03,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 06:04:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2025-03-17 06:04:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:04:03,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:03,471 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:03,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:04:03,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:04:03,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:03,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash -875942835, now seen corresponding path program 1 times [2025-03-17 06:04:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99128908] [2025-03-17 06:04:03,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:03,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:04:03,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:04:03,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:04:04,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:04,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99128908] [2025-03-17 06:04:04,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99128908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:04,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:04,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:04:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324676800] [2025-03-17 06:04:04,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:04,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:04:04,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:04,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:04:04,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:04:04,135 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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) [2025-03-17 06:04:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:04,185 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2025-03-17 06:04:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:04:04,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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 128 [2025-03-17 06:04:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:04,188 INFO L225 Difference]: With dead ends: 214 [2025-03-17 06:04:04,188 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 06:04:04,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:04:04,191 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:04,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 06:04:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-17 06:04:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 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) [2025-03-17 06:04:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-17 06:04:04,207 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 128 [2025-03-17 06:04:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:04,208 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-17 06:04:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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) [2025-03-17 06:04:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-17 06:04:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:04:04,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:04,209 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:04,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:04:04,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash -875019314, now seen corresponding path program 1 times [2025-03-17 06:04:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:04,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308301129] [2025-03-17 06:04:04,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:04,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:04:04,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:04:04,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:04,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:04:04,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:04,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308301129] [2025-03-17 06:04:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308301129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:04:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134956455] [2025-03-17 06:04:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:04:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:04,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:04:04,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:04:04,795 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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) [2025-03-17 06:04:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:04,981 INFO L93 Difference]: Finished difference Result 216 states and 308 transitions. [2025-03-17 06:04:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:04:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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 128 [2025-03-17 06:04:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:04,984 INFO L225 Difference]: With dead ends: 216 [2025-03-17 06:04:04,985 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 06:04:04,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:04:04,986 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 62 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:04,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 270 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:04:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 06:04:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-17 06:04:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 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) [2025-03-17 06:04:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-03-17 06:04:04,995 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 128 [2025-03-17 06:04:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:04,995 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-03-17 06:04:04,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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) [2025-03-17 06:04:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-03-17 06:04:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:04:04,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:04,997 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:04,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:04:04,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:04,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash -25983092, now seen corresponding path program 1 times [2025-03-17 06:04:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:04,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339616350] [2025-03-17 06:04:04,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:04,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:05,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:04:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:04:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 06:04:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339616350] [2025-03-17 06:04:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339616350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:04:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349175429] [2025-03-17 06:04:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:06,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:06,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:06,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:04:06,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:04:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:04:06,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:04:06,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:06,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:06,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 06:04:07,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:07,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:07,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:07,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:07,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 06:04:07,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 06:04:07,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:07,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 28 [2025-03-17 06:04:07,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:07,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-17 06:04:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 199 proven. 33 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-17 06:04:07,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:04:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 06:04:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349175429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:04:07,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 06:04:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17 [2025-03-17 06:04:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592292686] [2025-03-17 06:04:07,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 06:04:07,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:04:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:07,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:04:07,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:04:07,803 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 17 states, 15 states have (on average 5.733333333333333) internal successors, (86), 17 states have internal predecessors, (86), 5 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-17 06:04:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:08,871 INFO L93 Difference]: Finished difference Result 251 states and 352 transitions. [2025-03-17 06:04:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 06:04:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.733333333333333) internal successors, (86), 17 states have internal predecessors, (86), 5 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 5 states have call successors, (39) Word has length 130 [2025-03-17 06:04:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:08,873 INFO L225 Difference]: With dead ends: 251 [2025-03-17 06:04:08,873 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 06:04:08,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-17 06:04:08,874 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 407 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:08,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 624 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:04:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 06:04:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2025-03-17 06:04:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 117 states have internal predecessors, (156), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 06:04:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2025-03-17 06:04:08,892 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 130 [2025-03-17 06:04:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:08,893 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2025-03-17 06:04:08,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.733333333333333) internal successors, (86), 17 states have internal predecessors, (86), 5 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-17 06:04:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2025-03-17 06:04:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:04:08,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:08,895 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:08,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:04:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 06:04:09,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:09,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash 391811100, now seen corresponding path program 1 times [2025-03-17 06:04:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781107612] [2025-03-17 06:04:09,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:09,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:04:09,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:04:09,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:04:09,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:04:09,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781107612] [2025-03-17 06:04:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781107612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:09,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:04:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737501447] [2025-03-17 06:04:09,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:09,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:04:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:04:09,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:04:09,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:04:09,969 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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) [2025-03-17 06:04:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:10,503 INFO L93 Difference]: Finished difference Result 345 states and 473 transitions. [2025-03-17 06:04:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:04:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 131 [2025-03-17 06:04:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:10,505 INFO L225 Difference]: With dead ends: 345 [2025-03-17 06:04:10,505 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 06:04:10,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:04:10,506 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 192 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:10,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 427 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:04:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 06:04:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2025-03-17 06:04:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 139 states have internal predecessors, (180), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 06:04:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 244 transitions. [2025-03-17 06:04:10,533 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 244 transitions. Word has length 131 [2025-03-17 06:04:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:10,534 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 244 transitions. [2025-03-17 06:04:10,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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) [2025-03-17 06:04:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 244 transitions. [2025-03-17 06:04:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:04:10,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:10,535 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:10,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:04:10,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:10,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1239051966, now seen corresponding path program 1 times [2025-03-17 06:04:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:04:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623380118] [2025-03-17 06:04:10,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:04:10,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:04:10,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:04:10,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:10,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:04:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747762579] [2025-03-17 06:04:10,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:10,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:10,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:10,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:04:10,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:04:10,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:04:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:04:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:04:11,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:04:11,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 06:04:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 06:04:11,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:04:11,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:04:11,742 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:04:11,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:04:11,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:04:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:04:11,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 06:04:11,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:04:12,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:04:12 BoogieIcfgContainer [2025-03-17 06:04:12,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:04:12,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:04:12,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:04:12,002 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:04:12,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:02" (3/4) ... [2025-03-17 06:04:12,005 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:04:12,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:04:12,006 INFO L158 Benchmark]: Toolchain (without parser) took 10436.97ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.9MB in the beginning and 246.0MB in the end (delta: -122.1MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2025-03-17 06:04:12,006 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:12,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.47ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 107.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:04:12,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.43ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 102.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:04:12,007 INFO L158 Benchmark]: Boogie Preprocessor took 64.18ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:04:12,007 INFO L158 Benchmark]: IcfgBuilder took 636.57ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 65.2MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:04:12,008 INFO L158 Benchmark]: TraceAbstraction took 9346.24ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 64.5MB in the beginning and 246.0MB in the end (delta: -181.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-03-17 06:04:12,008 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 402.7MB. Free memory was 246.0MB in the beginning and 246.0MB in the end (delta: 69.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:04:12,009 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.44ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.47ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 107.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.43ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 102.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.18ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 100.1MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 636.57ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 65.2MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9346.24ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 64.5MB in the beginning and 246.0MB in the end (delta: -181.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 402.7MB. Free memory was 246.0MB in the beginning and 246.0MB in the end (delta: 69.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L55] unsigned char last_1_WrapperStruct00_var_1_7 = 0; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR WrapperStruct00.var_1_7 [L104] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L77] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L79] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L80] EXPR WrapperStruct00.var_1_5 [L80] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L80] EXPR WrapperStruct00.var_1_5 [L80] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L81] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L82] EXPR WrapperStruct00.var_1_6 [L82] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L82] EXPR WrapperStruct00.var_1_6 [L82] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L82] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L82] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L82] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L83] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L84] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L85] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L86] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L88] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L91] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L95] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] RET updateVariables() [L116] CALL step() [L59] WrapperStruct00.var_1_1 = ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))) [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L60] EXPR ((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L60] WrapperStruct00.var_1_3 = ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f))))) [L61] EXPR WrapperStruct00.var_1_17 [L61] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L62] EXPR WrapperStruct00.var_1_16 [L62] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L62] EXPR WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L62] signed long int stepLocal_0 = WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1; [L63] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0, stepLocal_0=0] [L63] COND TRUE (- (3351680781u - WrapperStruct00.var_1_8)) > stepLocal_0 [L64] EXPR WrapperStruct00.var_1_10 [L64] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L64] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L64] EXPR WrapperStruct00.var_1_11 [L64] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L64] EXPR ((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) [L64] EXPR WrapperStruct00.var_1_10 [L64] EXPR ((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L64] EXPR WrapperStruct00.var_1_12 [L64] WrapperStruct00.var_1_7 = (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12) [L66] EXPR WrapperStruct00.var_1_16 [L66] EXPR WrapperStruct00.var_1_14 [L66] EXPR WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L66] EXPR WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L66] COND FALSE !((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) [L69] EXPR WrapperStruct00.var_1_16 [L69] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L69] COND TRUE WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1 [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_11 [L70] WrapperStruct00.var_1_13 = (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f))))))) [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR WrapperStruct00.var_1_5 [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR ((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR ((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR (((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((((4 - WrapperStruct00.var_1_11) < 0 ) ? -(4 - WrapperStruct00.var_1_11) : (4 - WrapperStruct00.var_1_11))))) : ((WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_13 == ((signed short int) (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_13 == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR ((((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((((4 - WrapperStruct00.var_1_11) < 0 ) ? -(4 - WrapperStruct00.var_1_11) : (4 - WrapperStruct00.var_1_11))))) : ((WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_13 == ((signed short int) (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_13 == ((signed short int) 256))))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107-L108] return ((((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((((4 - WrapperStruct00.var_1_11) < 0 ) ? -(4 - WrapperStruct00.var_1_11) : (4 - WrapperStruct00.var_1_11))))) : ((WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_13 == ((signed short int) (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_13 == ((signed short int) 256))))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 176 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 1895 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1315 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1478 IncrementalHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 580 mSDtfsCounter, 1478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 58 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 2733 SizeOfPredicates, 8 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 3711/3840 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:04:12,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:04:14,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:04:14,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:04:14,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:04:14,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:04:14,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:04:14,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:04:14,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:04:14,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:04:14,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:04:14,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:04:14,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:04:14,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:04:14,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:04:14,276 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:04:14,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:04:14,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:04:14,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:04:14,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:04:14,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:04:14,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:04:14,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:04:14,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:04:14,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:14,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:04:14,279 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:04:14,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:04:14,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:04:14,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:04:14,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:04:14,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:04:14,280 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/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 -> 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 [2025-03-17 06:04:14,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:04:14,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:04:14,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:04:14,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:04:14,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:04:14,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2025-03-17 06:04:15,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc57caf0/91955efa35dc4feea8ec8b1d4945de13/FLAG1e197fc51 [2025-03-17 06:04:16,070 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:04:16,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2025-03-17 06:04:16,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc57caf0/91955efa35dc4feea8ec8b1d4945de13/FLAG1e197fc51 [2025-03-17 06:04:16,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc57caf0/91955efa35dc4feea8ec8b1d4945de13 [2025-03-17 06:04:16,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:04:16,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:04:16,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:16,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:04:16,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:04:16,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a18514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16, skipping insertion in model container [2025-03-17 06:04:16,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:04:16,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i[916,929] [2025-03-17 06:04:16,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:16,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:04:16,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i[916,929] [2025-03-17 06:04:16,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:04:16,417 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:04:16,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16 WrapperNode [2025-03-17 06:04:16,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:04:16,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:16,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:04:16,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:04:16,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,483 INFO L138 Inliner]: procedures = 37, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2025-03-17 06:04:16,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:04:16,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:04:16,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:04:16,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:04:16,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,527 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-03-17 06:04:16,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:04:16,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:04:16,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:04:16,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:04:16,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (1/1) ... [2025-03-17 06:04:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:04:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:04:16,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:04:16,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:04:16,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:04:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:04:16,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:04:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:04:16,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:04:16,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:04:18,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem81#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-17 06:04:18,586 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-17 06:04:18,586 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:04:18,594 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:04:18,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:04:18,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:18 BoogieIcfgContainer [2025-03-17 06:04:18,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:04:18,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:04:18,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:04:18,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:04:18,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:04:16" (1/3) ... [2025-03-17 06:04:18,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d60e206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:18, skipping insertion in model container [2025-03-17 06:04:18,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:04:16" (2/3) ... [2025-03-17 06:04:18,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d60e206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:04:18, skipping insertion in model container [2025-03-17 06:04:18,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:04:18" (3/3) ... [2025-03-17 06:04:18,603 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-95.i [2025-03-17 06:04:18,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:04:18,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-95.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:04:18,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:04:18,663 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;@79481e0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:04:18,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:04:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 79 states have internal predecessors, (111), 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) [2025-03-17 06:04:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 06:04:18,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:18,676 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:18,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:18,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1042422075, now seen corresponding path program 1 times [2025-03-17 06:04:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585064051] [2025-03-17 06:04:18,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:18,693 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 [2025-03-17 06:04:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:18,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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) [2025-03-17 06:04:18,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:18,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 06:04:19,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 06:04:19,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:19,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:19,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:04:19,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-17 06:04:19,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:19,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:19,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585064051] [2025-03-17 06:04:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585064051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:19,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:04:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784897557] [2025-03-17 06:04:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:04:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:19,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:04:19,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:19,197 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 79 states have internal predecessors, (111), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2025-03-17 06:04:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:19,226 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2025-03-17 06:04:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:04:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 125 [2025-03-17 06:04:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:19,231 INFO L225 Difference]: With dead ends: 191 [2025-03-17 06:04:19,231 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 06:04:19,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:04:19,235 INFO L435 NwaCegarLoop]: 135 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, 135 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 [2025-03-17 06:04:19,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:04:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 06:04:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 06:04:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 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) [2025-03-17 06:04:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-17 06:04:19,264 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 125 [2025-03-17 06:04:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:19,264 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-17 06:04:19,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2025-03-17 06:04:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-17 06:04:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 06:04:19,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:19,268 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:19,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:19,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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 [2025-03-17 06:04:19,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:19,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -87484595, now seen corresponding path program 1 times [2025-03-17 06:04:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730113506] [2025-03-17 06:04:19,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:19,470 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 [2025-03-17 06:04:19,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:19,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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) [2025-03-17 06:04:19,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:19,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 06:04:19,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 06:04:19,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:19,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:19,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:04:19,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:04:19,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:19,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730113506] [2025-03-17 06:04:19,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730113506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:19,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:04:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017980216] [2025-03-17 06:04:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:19,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:19,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:19,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:19,936 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2025-03-17 06:04:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:20,211 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-03-17 06:04:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:04:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 125 [2025-03-17 06:04:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:20,214 INFO L225 Difference]: With dead ends: 196 [2025-03-17 06:04:20,214 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:04:20,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:20,215 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:20,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:04:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:04:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:04:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 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) [2025-03-17 06:04:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-17 06:04:20,236 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 125 [2025-03-17 06:04:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:20,237 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-17 06:04:20,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2025-03-17 06:04:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-17 06:04:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 06:04:20,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:20,238 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:20,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:20,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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 [2025-03-17 06:04:20,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:20,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash -86561074, now seen corresponding path program 1 times [2025-03-17 06:04:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:20,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278792972] [2025-03-17 06:04:20,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:20,440 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 [2025-03-17 06:04:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:20,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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) [2025-03-17 06:04:20,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:20,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 06:04:20,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 06:04:20,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:20,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:20,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:20,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:20,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:04:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:04:20,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:20,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278792972] [2025-03-17 06:04:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278792972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951693357] [2025-03-17 06:04:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:20,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:20,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:20,928 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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) [2025-03-17 06:04:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:23,071 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2025-03-17 06:04:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:04:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 125 [2025-03-17 06:04:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:23,075 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:04:23,076 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:04:23,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:04:23,077 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 133 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:23,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 380 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 06:04:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:04:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:04:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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) [2025-03-17 06:04:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-03-17 06:04:23,091 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 125 [2025-03-17 06:04:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:23,091 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-03-17 06:04:23,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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) [2025-03-17 06:04:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2025-03-17 06:04:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:04:23,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:23,093 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:23,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:23,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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 [2025-03-17 06:04:23,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1812777684, now seen corresponding path program 1 times [2025-03-17 06:04:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:23,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071274548] [2025-03-17 06:04:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:23,295 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 [2025-03-17 06:04:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:23,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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) [2025-03-17 06:04:23,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-17 06:04:23,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:04:23,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:04:23,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:23,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:23,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:23,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:23,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:04:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:04:23,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:23,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071274548] [2025-03-17 06:04:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071274548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811355707] [2025-03-17 06:04:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:23,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:23,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:23,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:23,818 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-03-17 06:04:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:25,303 INFO L93 Difference]: Finished difference Result 202 states and 280 transitions. [2025-03-17 06:04:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:04:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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 127 [2025-03-17 06:04:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:25,305 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:04:25,305 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:04:25,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:04:25,306 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 121 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:25,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 375 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 06:04:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:04:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:04:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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) [2025-03-17 06:04:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-03-17 06:04:25,316 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 127 [2025-03-17 06:04:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:25,317 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-03-17 06:04:25,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-03-17 06:04:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-03-17 06:04:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 06:04:25,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:25,318 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:25,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:04:25,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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 [2025-03-17 06:04:25,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:25,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash -540637362, now seen corresponding path program 1 times [2025-03-17 06:04:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:25,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429121576] [2025-03-17 06:04:25,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:25,521 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 [2025-03-17 06:04:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:25,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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) [2025-03-17 06:04:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:04:25,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 06:04:25,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 06:04:25,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:25,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:25,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:04:25,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:26,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:04:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-17 06:04:26,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:26,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:26,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429121576] [2025-03-17 06:04:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429121576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:26,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:26,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:04:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283611777] [2025-03-17 06:04:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:26,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:04:26,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:26,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:04:26,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:04:26,082 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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) [2025-03-17 06:04:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:28,969 INFO L93 Difference]: Finished difference Result 202 states and 278 transitions. [2025-03-17 06:04:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:04:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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 129 [2025-03-17 06:04:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:28,978 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:04:28,978 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:04:28,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:04:28,979 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:28,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 371 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 06:04:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:04:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 06:04:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 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) [2025-03-17 06:04:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 138 transitions. [2025-03-17 06:04:29,005 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 138 transitions. Word has length 129 [2025-03-17 06:04:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:29,007 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 138 transitions. [2025-03-17 06:04:29,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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) [2025-03-17 06:04:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2025-03-17 06:04:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:04:29,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:29,013 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:29,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:04:29,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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 [2025-03-17 06:04:29,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:29,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash 221136812, now seen corresponding path program 1 times [2025-03-17 06:04:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291148648] [2025-03-17 06:04:29,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:29,217 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 [2025-03-17 06:04:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:29,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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) [2025-03-17 06:04:29,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Waiting until timeout for monitored process [2025-03-17 06:04:29,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:04:29,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:04:29,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:04:29,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:04:30,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 06:04:30,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:04:30,103 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 06:04:30,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 21 [2025-03-17 06:04:30,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:30,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 06:04:30,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:04:30,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:30,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2025-03-17 06:04:31,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:31,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 72 [2025-03-17 06:04:31,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:31,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 60 [2025-03-17 06:04:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 06:04:31,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:04:31,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:04:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291148648] [2025-03-17 06:04:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291148648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:04:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:04:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:04:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859987308] [2025-03-17 06:04:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:04:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:04:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:04:31,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:04:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:04:31,310 INFO L87 Difference]: Start difference. First operand 101 states and 138 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 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) [2025-03-17 06:04:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:04:36,942 INFO L93 Difference]: Finished difference Result 339 states and 463 transitions. [2025-03-17 06:04:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:04:36,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 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 131 [2025-03-17 06:04:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:04:36,964 INFO L225 Difference]: With dead ends: 339 [2025-03-17 06:04:36,964 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 06:04:36,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:04:36,965 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 266 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:04:36,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 400 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 06:04:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 06:04:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2025-03-17 06:04:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.263157894736842) internal successors, (168), 133 states have internal predecessors, (168), 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) [2025-03-17 06:04:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2025-03-17 06:04:37,036 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 131 [2025-03-17 06:04:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:04:37,036 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2025-03-17 06:04:37,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 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) [2025-03-17 06:04:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2025-03-17 06:04:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 06:04:37,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:04:37,038 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:04:37,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Ended with exit code 0 [2025-03-17 06:04:37,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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 [2025-03-17 06:04:37,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:04:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:04:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1679348950, now seen corresponding path program 1 times [2025-03-17 06:04:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:04:37,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317241859] [2025-03-17 06:04:37,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:04:37,244 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 [2025-03-17 06:04:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:04:37,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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) [2025-03-17 06:04:37,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2025-03-17 06:04:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.