./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-40.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 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:39:27,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:39:27,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:39:27,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:39:27,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:39:27,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:39:27,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:39:27,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:39:27,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:39:27,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:39:27,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:39:27,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:39:27,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:39:27,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:39:27,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:39:27,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:39:27,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:39:27,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:39:27,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:39:27,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:39:27,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:39:27,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:39:27,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:27,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:39:27,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:39:27,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:39:27,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:39:27,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:39:27,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:39:27,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:39:27,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:39:27,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:39:27,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:39:27,345 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 -> 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f [2025-03-04 01:39:27,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:39:27,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:39:27,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:39:27,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:39:27,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:39:27,580 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-40.i [2025-03-04 01:39:28,724 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7e3b3e8/49f4f011670046cf8a59f4076780d359/FLAGfa990a7e8 [2025-03-04 01:39:29,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:39:29,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i [2025-03-04 01:39:29,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7e3b3e8/49f4f011670046cf8a59f4076780d359/FLAGfa990a7e8 [2025-03-04 01:39:29,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7e3b3e8/49f4f011670046cf8a59f4076780d359 [2025-03-04 01:39:29,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:39:29,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:39:29,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:29,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:39:29,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:39:29,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcd15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29, skipping insertion in model container [2025-03-04 01:39:29,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:39:29,418 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-40.i[916,929] [2025-03-04 01:39:29,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:29,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:39:29,489 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-40.i[916,929] [2025-03-04 01:39:29,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:29,528 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:39:29,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29 WrapperNode [2025-03-04 01:39:29,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:29,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:29,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:39:29,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:39:29,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,581 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-03-04 01:39:29,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:29,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:39:29,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:39:29,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:39:29,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,599 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:39:29,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:39:29,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:39:29,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:39:29,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:39:29,622 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (1/1) ... [2025-03-04 01:39:29,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:29,654 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-04 01:39:29,659 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-04 01:39:29,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:39:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:39:29,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:39:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:39:29,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:39:29,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:39:29,757 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:39:29,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:39:30,137 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem70#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~short73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem114#1;havoc property_#t~mem113#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1; [2025-03-04 01:39:30,160 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-04 01:39:30,160 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:39:30,176 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:39:30,178 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:39:30,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:30 BoogieIcfgContainer [2025-03-04 01:39:30,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:39:30,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:39:30,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:39:30,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:39:30,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:39:29" (1/3) ... [2025-03-04 01:39:30,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199649bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:30, skipping insertion in model container [2025-03-04 01:39:30,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:29" (2/3) ... [2025-03-04 01:39:30,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199649bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:30, skipping insertion in model container [2025-03-04 01:39:30,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:30" (3/3) ... [2025-03-04 01:39:30,188 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-40.i [2025-03-04 01:39:30,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:39:30,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-40.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:39:30,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:39:30,245 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;@2fdb7386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:39:30,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:39:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:39:30,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:30,258 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:30,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:30,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 38009149, now seen corresponding path program 1 times [2025-03-04 01:39:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926671380] [2025-03-04 01:39:30,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:30,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:30,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:30,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:30,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:39:30,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926671380] [2025-03-04 01:39:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926671380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843675713] [2025-03-04 01:39:30,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:30,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:30,607 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-04 01:39:30,608 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-04 01:39:30,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:30,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:30,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:30,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:30,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:39:30,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:39:30,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:30,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843675713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:30,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:39:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910871502] [2025-03-04 01:39:30,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:30,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:39:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:30,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:39:30,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:30,848 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:30,871 INFO L93 Difference]: Finished difference Result 218 states and 344 transitions. [2025-03-04 01:39:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:39:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-03-04 01:39:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:30,877 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:39:30,877 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:39:30,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-04 01:39:30,881 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:30,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:39:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:39:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2025-03-04 01:39:30,919 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 150 [2025-03-04 01:39:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2025-03-04 01:39:30,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2025-03-04 01:39:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:39:30,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:30,927 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:30,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:31,128 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-04 01:39:31,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:31,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1676830746, now seen corresponding path program 1 times [2025-03-04 01:39:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910848301] [2025-03-04 01:39:31,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:31,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:31,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:31,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:31,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:39:31,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:31,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910848301] [2025-03-04 01:39:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910848301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:31,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150134411] [2025-03-04 01:39:31,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:31,540 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-04 01:39:31,541 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-04 01:39:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:31,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:31,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:31,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:31,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:39:31,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:31,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:31,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150134411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:31,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:31,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:39:31,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70498783] [2025-03-04 01:39:31,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:31,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:31,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:31,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:31,786 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:31,833 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2025-03-04 01:39:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:31,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:39:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:31,836 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:39:31,837 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:39:31,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:31,838 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:31,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:39:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 01:39:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2025-03-04 01:39:31,853 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 150 [2025-03-04 01:39:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:31,855 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2025-03-04 01:39:31,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2025-03-04 01:39:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:39:31,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:31,858 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:31,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:39:32,059 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,SelfDestructingSolverStorable1 [2025-03-04 01:39:32,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:32,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 810682087, now seen corresponding path program 1 times [2025-03-04 01:39:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:32,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-03-04 01:39:32,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:32,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:32,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:32,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:32,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:39:32,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-03-04 01:39:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77691305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716874988] [2025-03-04 01:39:32,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:32,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:32,329 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-04 01:39:32,331 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-04 01:39:32,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:32,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:32,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:32,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:32,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:39:32,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:32,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716874988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:32,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:32,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:39:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762604794] [2025-03-04 01:39:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:32,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:32,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:32,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:32,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:32,543 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:32,580 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2025-03-04 01:39:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:39:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:32,583 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:39:32,583 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:39:32,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:32,584 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:32,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:39:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 01:39:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-03-04 01:39:32,598 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 150 [2025-03-04 01:39:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:32,599 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-03-04 01:39:32,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-03-04 01:39:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:39:32,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:32,601 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:32,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:32,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:32,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:32,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1698185768, now seen corresponding path program 1 times [2025-03-04 01:39:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:32,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986004745] [2025-03-04 01:39:32,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:32,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:32,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:32,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:32,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:32,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:39:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986004745] [2025-03-04 01:39:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986004745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80794760] [2025-03-04 01:39:33,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:33,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:33,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:33,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:39:33,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:39:33,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:33,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:39:33,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:33,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80794760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:33,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:33,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:39:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615493136] [2025-03-04 01:39:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:33,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:33,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:33,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:33,237 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:33,262 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2025-03-04 01:39:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:39:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:33,264 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:39:33,264 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:39:33,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:33,264 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:33,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:39:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-04 01:39:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2025-03-04 01:39:33,275 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 150 [2025-03-04 01:39:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:33,276 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2025-03-04 01:39:33,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2025-03-04 01:39:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:39:33,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:33,279 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:33,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:33,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:33,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:33,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1699109289, now seen corresponding path program 1 times [2025-03-04 01:39:33,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:33,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84749479] [2025-03-04 01:39:33,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:33,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:33,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:39:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84749479] [2025-03-04 01:39:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84749479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773565582] [2025-03-04 01:39:33,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:33,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:33,660 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:39:33,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:39:33,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:39:33,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:39:33,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:33,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:33,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:39:33,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:33,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:33,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773565582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:33,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:33,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:39:33,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245371265] [2025-03-04 01:39:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:33,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:33,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:33,875 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:33,897 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2025-03-04 01:39:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:33,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-04 01:39:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:33,899 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:39:33,899 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:39:33,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:33,900 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:33,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:39:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 01:39:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 168 transitions. [2025-03-04 01:39:33,914 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 168 transitions. Word has length 150 [2025-03-04 01:39:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:33,914 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 168 transitions. [2025-03-04 01:39:33,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2025-03-04 01:39:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:39:33,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:33,916 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:33,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:34,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:34,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:34,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1906907736, now seen corresponding path program 1 times [2025-03-04 01:39:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783293459] [2025-03-04 01:39:34,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:34,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:39:34,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:39:34,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:34,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:39:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783293459] [2025-03-04 01:39:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783293459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230279555] [2025-03-04 01:39:34,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:34,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:34,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:39:34,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:39:34,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:39:34,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:39:34,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:34,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:34,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:39:34,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:34,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230279555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:39:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090657033] [2025-03-04 01:39:34,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:34,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:34,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:34,509 INFO L87 Difference]: Start difference. First operand 117 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:34,544 INFO L93 Difference]: Finished difference Result 234 states and 337 transitions. [2025-03-04 01:39:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:39:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:39:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:34,545 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:39:34,546 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:39:34,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:34,547 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:34,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:39:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2025-03-04 01:39:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:39:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2025-03-04 01:39:34,556 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 153 [2025-03-04 01:39:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2025-03-04 01:39:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:39:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2025-03-04 01:39:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:39:34,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:34,557 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:34,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:39:34,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:34,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:34,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1239365489, now seen corresponding path program 1 times [2025-03-04 01:39:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976725155] [2025-03-04 01:39:34,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:34,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:39:34,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:39:34,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:34,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976725155] [2025-03-04 01:39:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976725155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:39:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060416848] [2025-03-04 01:39:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:36,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:39:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:36,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:39:36,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:36,731 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 9 states, 6 states have (on average 10.166666666666666) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:39:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:37,393 INFO L93 Difference]: Finished difference Result 313 states and 445 transitions. [2025-03-04 01:39:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:39:37,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 10.166666666666666) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:39:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:37,395 INFO L225 Difference]: With dead ends: 313 [2025-03-04 01:39:37,395 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 01:39:37,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:39:37,396 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 87 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:37,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 976 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:39:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 01:39:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-03-04 01:39:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 163 states have (on average 1.3374233128834356) internal successors, (218), 164 states have internal predecessors, (218), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:39:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2025-03-04 01:39:37,409 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 153 [2025-03-04 01:39:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:37,409 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2025-03-04 01:39:37,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 10.166666666666666) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:39:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2025-03-04 01:39:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:39:37,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:37,410 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:37,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:39:37,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1749899666, now seen corresponding path program 1 times [2025-03-04 01:39:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253707124] [2025-03-04 01:39:37,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:37,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:39:37,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:39:37,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:37,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:46,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:46,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253707124] [2025-03-04 01:39:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253707124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:46,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:39:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51874693] [2025-03-04 01:39:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:39:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:46,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:39:46,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:46,323 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:50,480 INFO L93 Difference]: Finished difference Result 663 states and 934 transitions. [2025-03-04 01:39:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:39:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:39:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:50,484 INFO L225 Difference]: With dead ends: 663 [2025-03-04 01:39:50,484 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 01:39:50,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:39:50,485 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 208 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:50,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 691 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 01:39:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 01:39:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 463. [2025-03-04 01:39:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 394 states have internal predecessors, (519), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:39:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 651 transitions. [2025-03-04 01:39:50,518 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 651 transitions. Word has length 153 [2025-03-04 01:39:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:50,519 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 651 transitions. [2025-03-04 01:39:50,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 651 transitions. [2025-03-04 01:39:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:39:50,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:50,521 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:50,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:39:50,521 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 978392464, now seen corresponding path program 1 times [2025-03-04 01:39:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550346965] [2025-03-04 01:39:50,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:50,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:39:50,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:39:50,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:50,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550346965] [2025-03-04 01:39:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550346965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:39:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891700125] [2025-03-04 01:39:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:39:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:53,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:39:53,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:53,997 INFO L87 Difference]: Start difference. First operand 463 states and 651 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:56,999 INFO L93 Difference]: Finished difference Result 980 states and 1377 transitions. [2025-03-04 01:39:56,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:39:56,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:39:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:57,003 INFO L225 Difference]: With dead ends: 980 [2025-03-04 01:39:57,003 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 01:39:57,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:39:57,006 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 201 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:57,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 740 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 01:39:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 01:39:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 513. [2025-03-04 01:39:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 440 states have (on average 1.3386363636363636) internal successors, (589), 444 states have internal predecessors, (589), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 01:39:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 721 transitions. [2025-03-04 01:39:57,029 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 721 transitions. Word has length 153 [2025-03-04 01:39:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:57,029 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 721 transitions. [2025-03-04 01:39:57,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 721 transitions. [2025-03-04 01:39:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:39:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:57,030 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:57,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:39:57,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:57,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash 467858287, now seen corresponding path program 1 times [2025-03-04 01:39:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781036500] [2025-03-04 01:39:57,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:39:57,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:39:57,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:57,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:39:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781036500] [2025-03-04 01:39:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781036500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:57,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:39:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032888892] [2025-03-04 01:39:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:57,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:39:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:57,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:39:57,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:57,705 INFO L87 Difference]: Start difference. First operand 513 states and 721 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:58,145 INFO L93 Difference]: Finished difference Result 1077 states and 1506 transitions. [2025-03-04 01:39:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:39:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:39:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:58,149 INFO L225 Difference]: With dead ends: 1077 [2025-03-04 01:39:58,149 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 01:39:58,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:39:58,150 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 92 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:58,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1080 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:39:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 01:39:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2025-03-04 01:39:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 473 states have (on average 1.3150105708245243) internal successors, (622), 478 states have internal predecessors, (622), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 01:39:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 782 transitions. [2025-03-04 01:39:58,190 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 782 transitions. Word has length 153 [2025-03-04 01:39:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 782 transitions. [2025-03-04 01:39:58,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:39:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 782 transitions. [2025-03-04 01:39:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:39:58,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:58,194 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:39:58,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:39:58,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash -122512624, now seen corresponding path program 1 times [2025-03-04 01:39:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715001669] [2025-03-04 01:39:58,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:58,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:39:58,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:39:58,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:58,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:01,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715001669] [2025-03-04 01:40:01,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715001669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:01,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:01,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:40:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756402029] [2025-03-04 01:40:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:01,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:40:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:01,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:40:01,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:40:01,598 INFO L87 Difference]: Start difference. First operand 563 states and 782 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:40:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:05,289 INFO L93 Difference]: Finished difference Result 837 states and 1163 transitions. [2025-03-04 01:40:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:40:05,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-03-04 01:40:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:05,292 INFO L225 Difference]: With dead ends: 837 [2025-03-04 01:40:05,292 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 01:40:05,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:40:05,294 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 77 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:05,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 809 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:40:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 01:40:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 630. [2025-03-04 01:40:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 535 states have (on average 1.3196261682242991) internal successors, (706), 541 states have internal predecessors, (706), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-04 01:40:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 874 transitions. [2025-03-04 01:40:05,329 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 874 transitions. Word has length 155 [2025-03-04 01:40:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:05,330 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 874 transitions. [2025-03-04 01:40:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:40:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 874 transitions. [2025-03-04 01:40:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:40:05,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:05,331 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:05,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:40:05,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:05,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1689187790, now seen corresponding path program 1 times [2025-03-04 01:40:05,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:05,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412169379] [2025-03-04 01:40:05,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:05,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:05,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:40:05,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:40:05,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:05,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:40:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:10,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412169379] [2025-03-04 01:40:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412169379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680210708] [2025-03-04 01:40:10,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:10,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:10,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:10,043 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:10,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:40:10,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:40:10,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:40:10,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:10,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:10,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 01:40:10,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:10,378 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-04 01:40:10,404 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-04 01:40:10,425 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-04 01:40:10,439 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-04 01:40:10,452 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-04 01:40:10,498 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-04 01:40:10,567 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 48 treesize of output 35 [2025-03-04 01:40:10,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-03-04 01:40:10,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-03-04 01:40:10,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 34 [2025-03-04 01:40:11,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:11,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1736 treesize of output 825 [2025-03-04 01:40:12,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:12,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 402 treesize of output 199 [2025-03-04 01:40:13,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:13,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 415 treesize of output 183 [2025-03-04 01:40:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:16,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680210708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:16,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-03-04 01:40:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408965863] [2025-03-04 01:40:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:40:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:16,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:40:16,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:40:16,019 INFO L87 Difference]: Start difference. First operand 630 states and 874 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:19,895 INFO L93 Difference]: Finished difference Result 1004 states and 1392 transitions. [2025-03-04 01:40:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:40:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:40:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:19,908 INFO L225 Difference]: With dead ends: 1004 [2025-03-04 01:40:19,909 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 01:40:19,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:40:19,914 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 290 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:19,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 803 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:40:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 01:40:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 723. [2025-03-04 01:40:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 613 states have (on average 1.3181076672104404) internal successors, (808), 620 states have internal predecessors, (808), 97 states have call successors, (97), 12 states have call predecessors, (97), 12 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-04 01:40:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1002 transitions. [2025-03-04 01:40:20,018 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1002 transitions. Word has length 155 [2025-03-04 01:40:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:20,023 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1002 transitions. [2025-03-04 01:40:20,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1002 transitions. [2025-03-04 01:40:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:40:20,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:20,031 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:20,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:20,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:20,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:20,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 58064510, now seen corresponding path program 1 times [2025-03-04 01:40:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734742843] [2025-03-04 01:40:20,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:20,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:40:20,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:40:20,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:20,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:40:20,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734742843] [2025-03-04 01:40:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734742843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787517858] [2025-03-04 01:40:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:20,814 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:20,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:40:20,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:40:21,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:40:21,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:21,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:21,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:40:21,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:21,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787517858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:21,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-03-04 01:40:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420075330] [2025-03-04 01:40:21,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:21,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:21,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:21,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:40:21,090 INFO L87 Difference]: Start difference. First operand 723 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:21,165 INFO L93 Difference]: Finished difference Result 1423 states and 1969 transitions. [2025-03-04 01:40:21,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:40:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:21,169 INFO L225 Difference]: With dead ends: 1423 [2025-03-04 01:40:21,170 INFO L226 Difference]: Without dead ends: 755 [2025-03-04 01:40:21,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:40:21,172 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:21,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 751 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-03-04 01:40:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 731. [2025-03-04 01:40:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 621 states have (on average 1.3140096618357489) internal successors, (816), 628 states have internal predecessors, (816), 97 states have call successors, (97), 12 states have call predecessors, (97), 12 states have return successors, (97), 90 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-04 01:40:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1010 transitions. [2025-03-04 01:40:21,226 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1010 transitions. Word has length 155 [2025-03-04 01:40:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:21,227 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1010 transitions. [2025-03-04 01:40:21,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1010 transitions. [2025-03-04 01:40:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:40:21,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:21,231 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:21,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:21,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 01:40:21,432 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:21,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 131012932, now seen corresponding path program 1 times [2025-03-04 01:40:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919826511] [2025-03-04 01:40:21,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:21,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:40:21,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:40:21,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:21,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919826511] [2025-03-04 01:40:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919826511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746273979] [2025-03-04 01:40:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:22,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:22,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:22,130 INFO L87 Difference]: Start difference. First operand 731 states and 1010 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:22,570 INFO L93 Difference]: Finished difference Result 1529 states and 2109 transitions. [2025-03-04 01:40:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:40:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:22,574 INFO L225 Difference]: With dead ends: 1529 [2025-03-04 01:40:22,575 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 01:40:22,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:22,576 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 120 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 612 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:40:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 01:40:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 787. [2025-03-04 01:40:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 645 states have (on average 1.2868217054263567) internal successors, (830), 652 states have internal predecessors, (830), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 118 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-04 01:40:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1080 transitions. [2025-03-04 01:40:22,676 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1080 transitions. Word has length 155 [2025-03-04 01:40:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:22,677 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1080 transitions. [2025-03-04 01:40:22,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1080 transitions. [2025-03-04 01:40:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:40:22,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:22,679 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:22,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:40:22,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:22,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1646788777, now seen corresponding path program 1 times [2025-03-04 01:40:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742919950] [2025-03-04 01:40:22,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:22,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:40:22,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:40:22,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:22,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742919950] [2025-03-04 01:40:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742919950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192433596] [2025-03-04 01:40:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:23,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:23,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:23,344 INFO L87 Difference]: Start difference. First operand 787 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:23,733 INFO L93 Difference]: Finished difference Result 1585 states and 2175 transitions. [2025-03-04 01:40:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:40:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:23,739 INFO L225 Difference]: With dead ends: 1585 [2025-03-04 01:40:23,739 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 01:40:23,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:23,741 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 128 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:23,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 481 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:40:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 01:40:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 787. [2025-03-04 01:40:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 645 states have (on average 1.2806201550387597) internal successors, (826), 652 states have internal predecessors, (826), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 118 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-04 01:40:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1076 transitions. [2025-03-04 01:40:23,797 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1076 transitions. Word has length 155 [2025-03-04 01:40:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:23,798 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1076 transitions. [2025-03-04 01:40:23,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1076 transitions. [2025-03-04 01:40:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:40:23,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:23,800 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:40:23,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 159721091, now seen corresponding path program 1 times [2025-03-04 01:40:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910537997] [2025-03-04 01:40:23,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:23,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:23,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:23,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:40:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688572308] [2025-03-04 01:40:23,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:23,958 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:23,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:40:24,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:24,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:24,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:40:24,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:40:24,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:40:25,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:40:25,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:25,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:40:25,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:40:25,538 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:40:25,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:40:25,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 01:40:25,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 01:40:25,744 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:25,806 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:40:25,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:40:25 BoogieIcfgContainer [2025-03-04 01:40:25,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:40:25,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:40:25,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:40:25,815 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:40:25,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:30" (3/4) ... [2025-03-04 01:40:25,818 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:40:25,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:40:25,821 INFO L158 Benchmark]: Toolchain (without parser) took 56521.35ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 111.7MB in the beginning and 116.2MB in the end (delta: -4.5MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2025-03-04 01:40:25,821 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:25,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.56ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 95.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:40:25,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.42ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:25,821 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:40:25,822 INFO L158 Benchmark]: IcfgBuilder took 558.51ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 55.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:40:25,822 INFO L158 Benchmark]: TraceAbstraction took 55629.29ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 54.7MB in the beginning and 116.3MB in the end (delta: -61.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-03-04 01:40:25,822 INFO L158 Benchmark]: Witness Printer took 8.98ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 116.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:25,823 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.56ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 95.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.42ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 88.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 558.51ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 55.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55629.29ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 54.7MB in the beginning and 116.3MB in the end (delta: -61.6MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 8.98ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 116.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -4, 0, 0, 64, -2, -10, 128, 1, 8.4, 49.75, -2, 25, -5, 7.5, 1, -256 }; [L59] double last_1_WrapperStruct00_var_1_13 = 8.4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=42/5] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_13 [L118] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L96] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L98] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L100] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L109] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L110] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L113] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L115] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L129] RET updateVariables() [L130] CALL step() [L63] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L63] COND FALSE !(WrapperStruct00.var_1_3) [L66] EXPR WrapperStruct00.var_1_15 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_15 [L67] EXPR WrapperStruct00.var_1_16 [L67] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_16 [L68] EXPR WrapperStruct00.var_1_18 [L68] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_18 [L69] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L69] COND FALSE !(WrapperStruct00.var_1_2) [L78] EXPR WrapperStruct00.var_1_16 [L78] EXPR WrapperStruct00.var_1_8 [L78] EXPR WrapperStruct00.var_1_9 [L78] EXPR WrapperStruct00.var_1_21 [L78] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L78] EXPR WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L78] COND TRUE ((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16) [L79] EXPR WrapperStruct00.var_1_11 [L79] EXPR WrapperStruct00.var_1_12 [L79] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) [L83] EXPR WrapperStruct00.var_1_19 [L83] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L83] EXPR ((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L83] COND TRUE WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19))) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 + (127.4 - 8.25)) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12))) [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_8 [L121] EXPR WrapperStruct00.var_1_9 [L121] EXPR WrapperStruct00.var_1_21 [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)) [L121] EXPR WrapperStruct00.var_1_7 [L121] EXPR WrapperStruct00.var_1_11 [L121] EXPR WrapperStruct00.var_1_12 [L121] EXPR (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1) [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1 [L121] EXPR WrapperStruct00.var_1_13 [L121] EXPR WrapperStruct00.var_1_15 [L121] EXPR (WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15))) && (WrapperStruct00.var_1_20 == ((signed short int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15))) && (WrapperStruct00.var_1_20 == ((signed short int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_21 == ((signed short int) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121-L122] return ((((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15))) && (WrapperStruct00.var_1_20 == ((signed short int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_21 == ((signed short int) WrapperStruct00.var_1_18)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 16, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1206 mSDsluCounter, 9529 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7141 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4629 IncrementalHoareTripleChecker+Invalid, 4728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 2388 mSDtfsCounter, 4629 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1409 GetRequests, 1293 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=787occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 211 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 3815 NumberOfCodeBlocks, 3815 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3480 ConstructedInterpolants, 0 QuantifiedInterpolants, 26520 SizeOfPredicates, 4 NumberOfNonLiveVariables, 4329 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 15336/15732 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-04 01:40:25,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-40.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 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:40:27,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:40:27,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:40:27,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:40:27,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:40:27,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:40:27,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:40:27,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:40:27,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:40:27,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:40:27,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:40:27,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:40:27,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:40:27,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:40:27,623 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:40:27,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:40:27,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:40:27,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:40:27,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:40:27,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:40:27,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:27,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:40:27,625 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:40:27,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:40:27,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:40:27,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:40:27,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:40:27,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:40:27,626 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 -> 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f [2025-03-04 01:40:27,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:40:27,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:40:27,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:40:27,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:40:27,863 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:40:27,864 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-40.i [2025-03-04 01:40:29,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bc360c9/f89d6e29ea214c34ac34dee122a6eb46/FLAG5e9fb5e70 [2025-03-04 01:40:29,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:40:29,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i [2025-03-04 01:40:29,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bc360c9/f89d6e29ea214c34ac34dee122a6eb46/FLAG5e9fb5e70 [2025-03-04 01:40:29,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bc360c9/f89d6e29ea214c34ac34dee122a6eb46 [2025-03-04 01:40:29,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:40:29,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:40:29,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:29,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:40:29,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:40:29,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29, skipping insertion in model container [2025-03-04 01:40:29,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:40:29,350 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-40.i[916,929] [2025-03-04 01:40:29,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:29,405 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:40:29,414 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-40.i[916,929] [2025-03-04 01:40:29,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:29,476 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:40:29,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29 WrapperNode [2025-03-04 01:40:29,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:29,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:29,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:40:29,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:40:29,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,532 INFO L138 Inliner]: procedures = 40, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-03-04 01:40:29,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:29,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:40:29,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:40:29,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:40:29,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,575 INFO L175 MemorySlicer]: Split 121 memory accesses to 2 slices as follows [2, 119]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-03-04 01:40:29,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:40:29,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:40:29,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:40:29,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:40:29,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (1/1) ... [2025-03-04 01:40:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:29,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:29,642 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-04 01:40:29,645 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-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:40:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:40:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:40:29,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:40:29,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:40:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:40:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:40:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:40:29,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:40:29,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:40:31,883 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem69#1;havoc property_#t~ite81#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~short72#1;havoc property_#t~ite80#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem97#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1; [2025-03-04 01:40:31,922 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-03-04 01:40:31,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:40:31,933 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:40:31,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:40:31,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:31 BoogieIcfgContainer [2025-03-04 01:40:31,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:40:31,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:40:31,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:40:31,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:40:31,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:40:29" (1/3) ... [2025-03-04 01:40:31,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793f811a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:31, skipping insertion in model container [2025-03-04 01:40:31,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:29" (2/3) ... [2025-03-04 01:40:31,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793f811a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:31, skipping insertion in model container [2025-03-04 01:40:31,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:31" (3/3) ... [2025-03-04 01:40:31,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-40.i [2025-03-04 01:40:31,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:40:31,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-40.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:40:31,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:40:31,985 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;@6806b0cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:40:31,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:40:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 85 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:40:32,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:32,001 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:32,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash -247462594, now seen corresponding path program 1 times [2025-03-04 01:40:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971715980] [2025-03-04 01:40:32,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:32,015 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-04 01:40:32,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:32,016 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-04 01:40:32,017 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-04 01:40:32,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:40:32,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:40:32,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:32,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:32,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:40:32,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-04 01:40:32,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:32,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971715980] [2025-03-04 01:40:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971715980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:40:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289100867] [2025-03-04 01:40:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:40:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:32,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:40:32,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:40:32,384 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 85 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:40:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:32,401 INFO L93 Difference]: Finished difference Result 206 states and 324 transitions. [2025-03-04 01:40:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:40:32,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-03-04 01:40:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:32,406 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:40:32,406 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:40:32,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-04 01:40:32,409 INFO L435 NwaCegarLoop]: 150 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, 150 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-04 01:40:32,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:40:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 01:40:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2025-03-04 01:40:32,438 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 149 [2025-03-04 01:40:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:32,438 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2025-03-04 01:40:32,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:40:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2025-03-04 01:40:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:40:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:32,441 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:32,452 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-04 01:40:32,641 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-04 01:40:32,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:32,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1411158667, now seen corresponding path program 1 times [2025-03-04 01:40:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834235339] [2025-03-04 01:40:32,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:32,643 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-04 01:40:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:32,644 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-04 01:40:32,646 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-04 01:40:32,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:40:32,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:40:32,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:32,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:32,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:32,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:33,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:33,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834235339] [2025-03-04 01:40:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834235339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:40:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369602327] [2025-03-04 01:40:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:33,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:33,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:33,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:33,009 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:33,053 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2025-03-04 01:40:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:33,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-04 01:40:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:33,055 INFO L225 Difference]: With dead ends: 205 [2025-03-04 01:40:33,055 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 01:40:33,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 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-04 01:40:33,056 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:33,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 01:40:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 01:40:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2025-03-04 01:40:33,066 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 149 [2025-03-04 01:40:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:33,067 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2025-03-04 01:40:33,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2025-03-04 01:40:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:40:33,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:33,068 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:33,080 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-04 01:40:33,269 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-04 01:40:33,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1971058291, now seen corresponding path program 1 times [2025-03-04 01:40:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603255249] [2025-03-04 01:40:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:33,270 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-04 01:40:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:33,272 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-04 01:40:33,273 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-04 01:40:33,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:40:33,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:40:33,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:33,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:33,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:33,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:33,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603255249] [2025-03-04 01:40:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603255249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:33,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877123961] [2025-03-04 01:40:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:33,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:33,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:33,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:33,641 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:33,780 INFO L93 Difference]: Finished difference Result 212 states and 308 transitions. [2025-03-04 01:40:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:33,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:40:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:33,784 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:40:33,784 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:40:33,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:33,788 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:33,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 564 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:40:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 01:40:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-04 01:40:33,797 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 151 [2025-03-04 01:40:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:33,798 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-04 01:40:33,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-04 01:40:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:40:33,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:33,800 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:33,814 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 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:34,002 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-04 01:40:34,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:34,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash 163603828, now seen corresponding path program 1 times [2025-03-04 01:40:34,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:34,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010822453] [2025-03-04 01:40:34,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:34,004 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-04 01:40:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:34,007 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-04 01:40:34,008 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-04 01:40:34,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:40:34,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:40:34,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:34,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:40:34,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:34,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:34,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010822453] [2025-03-04 01:40:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010822453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:34,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:40:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574324584] [2025-03-04 01:40:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:34,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:34,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:34,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:34,382 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:34,553 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2025-03-04 01:40:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:40:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:34,555 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:40:34,555 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:40:34,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 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-04 01:40:34,557 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:34,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 695 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:40:34,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:40:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 01:40:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-03-04 01:40:34,570 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 151 [2025-03-04 01:40:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:34,571 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-03-04 01:40:34,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-03-04 01:40:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:40:34,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:34,572 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:34,586 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-04 01:40:34,776 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-04 01:40:34,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:34,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1051107509, now seen corresponding path program 1 times [2025-03-04 01:40:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039651242] [2025-03-04 01:40:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:34,777 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-04 01:40:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:34,781 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-04 01:40:34,782 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-04 01:40:34,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:40:35,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:40:35,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:35,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:35,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:40:35,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:35,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:35,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:35,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039651242] [2025-03-04 01:40:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039651242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:35,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:40:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115099782] [2025-03-04 01:40:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:35,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:40:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:40:35,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:35,135 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:35,330 INFO L93 Difference]: Finished difference Result 222 states and 317 transitions. [2025-03-04 01:40:35,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:40:35,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:40:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:35,331 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:40:35,331 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:40:35,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:35,332 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:35,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 827 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:40:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:40:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-04 01:40:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2025-03-04 01:40:35,341 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 151 [2025-03-04 01:40:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:35,342 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2025-03-04 01:40:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2025-03-04 01:40:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:40:35,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:35,344 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:35,357 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 (6)] Ended with exit code 0 [2025-03-04 01:40:35,544 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-04 01:40:35,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1052031030, now seen corresponding path program 1 times [2025-03-04 01:40:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643180871] [2025-03-04 01:40:35,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:35,546 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-04 01:40:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:35,547 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-04 01:40:35,548 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-04 01:40:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:40:35,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:40:35,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:35,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:35,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:40:35,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:35,934 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 55 treesize of output 19 [2025-03-04 01:40:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:40:36,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:36,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643180871] [2025-03-04 01:40:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643180871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:36,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:40:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492617160] [2025-03-04 01:40:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:36,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:36,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:36,333 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:40,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:40:46,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:40:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:46,315 INFO L93 Difference]: Finished difference Result 224 states and 319 transitions. [2025-03-04 01:40:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:40:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:46,334 INFO L225 Difference]: With dead ends: 224 [2025-03-04 01:40:46,334 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:40:46,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:46,335 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:46,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2025-03-04 01:40:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:40:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:40:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:40:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2025-03-04 01:40:46,339 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 151 [2025-03-04 01:40:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:46,340 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2025-03-04 01:40:46,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:40:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2025-03-04 01:40:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:40:46,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:46,341 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:40:46,356 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-04 01:40:46,541 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-04 01:40:46,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:46,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 840680117, now seen corresponding path program 1 times [2025-03-04 01:40:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157786817] [2025-03-04 01:40:46,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:46,543 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-04 01:40:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:46,544 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-04 01:40:46,545 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-04 01:40:46,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:40:47,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:40:47,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:47,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:47,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 01:40:47,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:47,263 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 99 treesize of output 98 [2025-03-04 01:40:47,713 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 226 treesize of output 186