./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:17:23,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:17:23,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:17:23,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:17:23,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:17:23,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:17:23,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:17:23,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:17:23,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:17:23,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:17:23,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:17:23,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:17:23,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:17:23,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:17:23,484 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:17:23,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:17:23,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:17:23,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:17:23,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:17:23,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:17:23,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:23,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:17:23,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:23,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:17:23,486 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 [2025-01-09 16:17:23,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:17:23,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:17:23,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:17:23,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:17:23,708 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:17:23,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2025-01-09 16:17:24,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e4c7dc5d/3e2f14cdf1854bc6b49654c7dc259825/FLAG4e6dfd4e4 [2025-01-09 16:17:25,154 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:17:25,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2025-01-09 16:17:25,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e4c7dc5d/3e2f14cdf1854bc6b49654c7dc259825/FLAG4e6dfd4e4 [2025-01-09 16:17:25,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e4c7dc5d/3e2f14cdf1854bc6b49654c7dc259825 [2025-01-09 16:17:25,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:17:25,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:17:25,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:25,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:17:25,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:17:25,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b277b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25, skipping insertion in model container [2025-01-09 16:17:25,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:17:25,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2025-01-09 16:17:25,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:25,668 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:17:25,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2025-01-09 16:17:25,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:25,739 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:17:25,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25 WrapperNode [2025-01-09 16:17:25,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:25,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:25,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:17:25,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:17:25,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,822 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2025-01-09 16:17:25,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:25,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:17:25,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:17:25,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:17:25,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,849 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:17:25,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:17:25,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:17:25,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:17:25,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:17:25,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (1/1) ... [2025-01-09 16:17:25,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:25,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:25,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:17:25,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:17:25,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:17:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:17:25,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:17:25,992 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:17:25,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:17:26,510 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-01-09 16:17:26,510 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:17:26,524 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:17:26,525 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:17:26,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:26 BoogieIcfgContainer [2025-01-09 16:17:26,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:17:26,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:17:26,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:17:26,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:17:26,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:25" (1/3) ... [2025-01-09 16:17:26,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6d4f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:26, skipping insertion in model container [2025-01-09 16:17:26,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:25" (2/3) ... [2025-01-09 16:17:26,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6d4f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:26, skipping insertion in model container [2025-01-09 16:17:26,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:26" (3/3) ... [2025-01-09 16:17:26,536 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2025-01-09 16:17:26,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:17:26,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-96.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:17:26,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:17:26,614 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;@204c31d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:17:26,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:17:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:26,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:26,629 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:26,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:26,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash 271694585, now seen corresponding path program 1 times [2025-01-09 16:17:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650415187] [2025-01-09 16:17:26,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:26,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:26,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:26,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 16:17:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650415187] [2025-01-09 16:17:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650415187] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697934430] [2025-01-09 16:17:27,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:27,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:27,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:27,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:17:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:17:27,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:27,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:27,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:27,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:27,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:17:27,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 16:17:27,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697934430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:27,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:17:27,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:17:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984669796] [2025-01-09 16:17:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:27,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:17:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:27,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:17:27,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:17:27,245 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 16:17:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:27,263 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2025-01-09 16:17:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:17:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-01-09 16:17:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:27,268 INFO L225 Difference]: With dead ends: 208 [2025-01-09 16:17:27,268 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 16:17:27,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-01-09 16:17:27,273 INFO L435 NwaCegarLoop]: 152 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, 152 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-01-09 16:17:27,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 16:17:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 16:17:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2025-01-09 16:17:27,300 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2025-01-09 16:17:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:27,300 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2025-01-09 16:17:27,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 16:17:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2025-01-09 16:17:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:27,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:27,303 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:27,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:17:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:17:27,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:27,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 439559581, now seen corresponding path program 1 times [2025-01-09 16:17:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364763363] [2025-01-09 16:17:27,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:27,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:27,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:27,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:27,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:27,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364763363] [2025-01-09 16:17:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364763363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:27,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762676627] [2025-01-09 16:17:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:27,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:27,892 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:27,937 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2025-01-09 16:17:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:27,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 16:17:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:27,940 INFO L225 Difference]: With dead ends: 208 [2025-01-09 16:17:27,942 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 16:17:27,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:27,943 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:27,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 16:17:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 16:17:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-01-09 16:17:27,959 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 131 [2025-01-09 16:17:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:27,960 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-01-09 16:17:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-01-09 16:17:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:27,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:27,963 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:27,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:17:27,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:27,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1119617951, now seen corresponding path program 1 times [2025-01-09 16:17:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073794936] [2025-01-09 16:17:27,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:28,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:28,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:28,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:28,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073794936] [2025-01-09 16:17:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073794936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111324202] [2025-01-09 16:17:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:28,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:28,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:28,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:28,186 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:28,218 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-01-09 16:17:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:28,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 16:17:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:28,221 INFO L225 Difference]: With dead ends: 212 [2025-01-09 16:17:28,224 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:17:28,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:28,225 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:28,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:17:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-01-09 16:17:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-01-09 16:17:28,236 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2025-01-09 16:17:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:28,238 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-01-09 16:17:28,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-01-09 16:17:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:28,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:28,242 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:28,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:17:28,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:28,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1121464993, now seen corresponding path program 1 times [2025-01-09 16:17:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:28,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008224404] [2025-01-09 16:17:28,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:28,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:28,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:28,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:28,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:28,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:28,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008224404] [2025-01-09 16:17:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008224404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:28,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:28,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:17:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106794941] [2025-01-09 16:17:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:28,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:28,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:28,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:28,609 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:28,931 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2025-01-09 16:17:28,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 16:17:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:28,934 INFO L225 Difference]: With dead ends: 215 [2025-01-09 16:17:28,934 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 16:17:28,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 16:17:28,935 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:28,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:17:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 16:17:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 16:17:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-01-09 16:17:28,950 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2025-01-09 16:17:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:28,951 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-01-09 16:17:28,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-01-09 16:17:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:28,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:28,955 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:17:28,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash -567478749, now seen corresponding path program 1 times [2025-01-09 16:17:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130262600] [2025-01-09 16:17:28,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:28,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:29,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:29,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:29,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:31,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:31,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130262600] [2025-01-09 16:17:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130262600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:31,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:17:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319594368] [2025-01-09 16:17:31,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:31,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:17:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:31,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:17:31,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:17:31,539 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 16:17:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:32,240 INFO L93 Difference]: Finished difference Result 276 states and 398 transitions. [2025-01-09 16:17:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:32,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2025-01-09 16:17:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:32,242 INFO L225 Difference]: With dead ends: 276 [2025-01-09 16:17:32,242 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 16:17:32,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:17:32,243 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 293 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 431 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:17:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 16:17:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 122. [2025-01-09 16:17:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2025-01-09 16:17:32,253 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 131 [2025-01-09 16:17:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:32,253 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2025-01-09 16:17:32,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 16:17:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2025-01-09 16:17:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 16:17:32,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:32,254 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:32,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:17:32,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2113937033, now seen corresponding path program 1 times [2025-01-09 16:17:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:32,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244620896] [2025-01-09 16:17:32,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:32,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 16:17:32,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 16:17:32,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:32,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244620896] [2025-01-09 16:17:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244620896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:32,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:32,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711932110] [2025-01-09 16:17:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:32,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:32,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:32,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:32,604 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:32,639 INFO L93 Difference]: Finished difference Result 239 states and 347 transitions. [2025-01-09 16:17:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:32,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-01-09 16:17:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:32,640 INFO L225 Difference]: With dead ends: 239 [2025-01-09 16:17:32,640 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:17:32,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:32,641 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:32,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:17:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 16:17:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2025-01-09 16:17:32,649 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 133 [2025-01-09 16:17:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:32,650 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2025-01-09 16:17:32,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2025-01-09 16:17:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 16:17:32,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:32,651 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:17:32,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:32,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1693650849, now seen corresponding path program 1 times [2025-01-09 16:17:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-01-09 16:17:32,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:32,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 16:17:32,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 16:17:32,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:32,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 16:17:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213441188] [2025-01-09 16:17:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213441188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:32,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877555388] [2025-01-09 16:17:32,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:32,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:32,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:32,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:17:32,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:17:32,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 16:17:32,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 16:17:32,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:32,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:32,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:17:32,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:33,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877555388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:33,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:17:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:17:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947430695] [2025-01-09 16:17:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:33,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:33,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:33,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:17:33,009 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:33,040 INFO L93 Difference]: Finished difference Result 240 states and 345 transitions. [2025-01-09 16:17:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-01-09 16:17:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:33,042 INFO L225 Difference]: With dead ends: 240 [2025-01-09 16:17:33,042 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 16:17:33,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:17:33,043 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:33,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 16:17:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 16:17:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.361904761904762) internal successors, (143), 105 states have internal predecessors, (143), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-01-09 16:17:33,056 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 133 [2025-01-09 16:17:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:33,056 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-01-09 16:17:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-01-09 16:17:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 16:17:33,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:33,057 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:33,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:17:33,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:33,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:33,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 153020190, now seen corresponding path program 1 times [2025-01-09 16:17:33,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913267809] [2025-01-09 16:17:33,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:33,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 16:17:33,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 16:17:33,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:33,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:33,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913267809] [2025-01-09 16:17:33,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913267809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:33,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:33,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:17:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359150787] [2025-01-09 16:17:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:33,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:17:33,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:33,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:17:33,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:17:33,341 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:33,367 INFO L93 Difference]: Finished difference Result 294 states and 418 transitions. [2025-01-09 16:17:33,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:17:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-01-09 16:17:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:33,369 INFO L225 Difference]: With dead ends: 294 [2025-01-09 16:17:33,369 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 16:17:33,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:17:33,370 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 64 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:33,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 289 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 16:17:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2025-01-09 16:17:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2025-01-09 16:17:33,382 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 133 [2025-01-09 16:17:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:33,383 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2025-01-09 16:17:33,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2025-01-09 16:17:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 16:17:33,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:33,384 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:33,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:17:33,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:33,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:33,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1691235207, now seen corresponding path program 1 times [2025-01-09 16:17:33,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:33,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049019671] [2025-01-09 16:17:33,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:33,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 16:17:33,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 16:17:33,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:33,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:33,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049019671] [2025-01-09 16:17:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049019671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:17:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169886725] [2025-01-09 16:17:33,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:33,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:33,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:33,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:33,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:33,509 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:33,694 INFO L93 Difference]: Finished difference Result 261 states and 369 transitions. [2025-01-09 16:17:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-01-09 16:17:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:33,695 INFO L225 Difference]: With dead ends: 261 [2025-01-09 16:17:33,695 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 16:17:33,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 16:17:33,696 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:33,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 464 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:17:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 16:17:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 16:17:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2025-01-09 16:17:33,704 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 133 [2025-01-09 16:17:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:33,705 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2025-01-09 16:17:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2025-01-09 16:17:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 16:17:33,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:33,706 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:33,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:17:33,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 653769502, now seen corresponding path program 1 times [2025-01-09 16:17:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:33,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983134612] [2025-01-09 16:17:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:33,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 16:17:33,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 16:17:33,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:33,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:33,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983134612] [2025-01-09 16:17:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983134612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:17:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447130641] [2025-01-09 16:17:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:33,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:17:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:33,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:17:33,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:17:33,766 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:33,820 INFO L93 Difference]: Finished difference Result 297 states and 409 transitions. [2025-01-09 16:17:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:17:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-01-09 16:17:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:33,822 INFO L225 Difference]: With dead ends: 297 [2025-01-09 16:17:33,822 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 16:17:33,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:17:33,823 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:33,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 16:17:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2025-01-09 16:17:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2025-01-09 16:17:33,831 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 133 [2025-01-09 16:17:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:33,831 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2025-01-09 16:17:33,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2025-01-09 16:17:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:17:33,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:33,832 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:17:33,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -864082588, now seen corresponding path program 1 times [2025-01-09 16:17:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231256559] [2025-01-09 16:17:33,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:33,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:17:33,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:17:33,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:33,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:34,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231256559] [2025-01-09 16:17:34,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231256559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:34,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:34,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:17:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532815259] [2025-01-09 16:17:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:34,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:17:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:34,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:17:34,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:17:34,097 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:34,360 INFO L93 Difference]: Finished difference Result 263 states and 361 transitions. [2025-01-09 16:17:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:17:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-01-09 16:17:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:34,361 INFO L225 Difference]: With dead ends: 263 [2025-01-09 16:17:34,362 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 16:17:34,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-09 16:17:34,362 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 12 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:34,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 447 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:17:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 16:17:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2025-01-09 16:17:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-01-09 16:17:34,384 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 134 [2025-01-09 16:17:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:34,384 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-01-09 16:17:34,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-01-09 16:17:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 16:17:34,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:34,387 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:34,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:17:34,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:34,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1246517593, now seen corresponding path program 1 times [2025-01-09 16:17:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561489196] [2025-01-09 16:17:34,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:34,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 16:17:34,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 16:17:34,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561489196] [2025-01-09 16:17:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561489196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143560702] [2025-01-09 16:17:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:34,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:34,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:34,705 INFO L87 Difference]: Start difference. First operand 130 states and 176 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:34,860 INFO L93 Difference]: Finished difference Result 368 states and 500 transitions. [2025-01-09 16:17:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:34,860 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-01-09 16:17:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:34,862 INFO L225 Difference]: With dead ends: 368 [2025-01-09 16:17:34,862 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 16:17:34,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:34,862 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 108 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:34,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:17:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 16:17:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 180. [2025-01-09 16:17:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 145 states have internal predecessors, (183), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 247 transitions. [2025-01-09 16:17:34,883 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 247 transitions. Word has length 135 [2025-01-09 16:17:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:34,883 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 247 transitions. [2025-01-09 16:17:34,883 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 247 transitions. [2025-01-09 16:17:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:17:34,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:34,885 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:34,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:17:34,885 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:34,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1190037391, now seen corresponding path program 1 times [2025-01-09 16:17:34,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:34,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687420052] [2025-01-09 16:17:34,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:34,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:17:34,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:17:34,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:34,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:34,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687420052] [2025-01-09 16:17:34,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687420052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:34,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:34,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:17:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025546656] [2025-01-09 16:17:34,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:34,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:34,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:34,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:34,975 INFO L87 Difference]: Start difference. First operand 180 states and 247 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:35,019 INFO L93 Difference]: Finished difference Result 348 states and 476 transitions. [2025-01-09 16:17:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:35,019 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-01-09 16:17:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:35,022 INFO L225 Difference]: With dead ends: 348 [2025-01-09 16:17:35,023 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 16:17:35,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:35,024 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 55 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:35,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 411 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 16:17:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 185. [2025-01-09 16:17:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 255 transitions. [2025-01-09 16:17:35,042 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 255 transitions. Word has length 136 [2025-01-09 16:17:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:35,042 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 255 transitions. [2025-01-09 16:17:35,042 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 255 transitions. [2025-01-09 16:17:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:17:35,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:35,043 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:17:35,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2083861551, now seen corresponding path program 1 times [2025-01-09 16:17:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740222051] [2025-01-09 16:17:35,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:35,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:17:35,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:17:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:35,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 16:17:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740222051] [2025-01-09 16:17:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740222051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:17:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526379940] [2025-01-09 16:17:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:35,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:35,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:35,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:17:35,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:17:35,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:17:35,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:17:35,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:35,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:35,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:17:35,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:35,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526379940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:17:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 16:17:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519550431] [2025-01-09 16:17:35,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:35,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:17:35,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:35,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:17:35,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:17:35,504 INFO L87 Difference]: Start difference. First operand 185 states and 255 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:35,549 INFO L93 Difference]: Finished difference Result 321 states and 441 transitions. [2025-01-09 16:17:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:17:35,550 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-01-09 16:17:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:35,551 INFO L225 Difference]: With dead ends: 321 [2025-01-09 16:17:35,551 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 16:17:35,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:17:35,552 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:35,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 16:17:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2025-01-09 16:17:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.271523178807947) internal successors, (192), 151 states have internal predecessors, (192), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 256 transitions. [2025-01-09 16:17:35,578 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 256 transitions. Word has length 136 [2025-01-09 16:17:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:35,578 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 256 transitions. [2025-01-09 16:17:35,579 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 256 transitions. [2025-01-09 16:17:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:17:35,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:35,581 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:35,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:17:35,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:17:35,787 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:35,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1632521057, now seen corresponding path program 1 times [2025-01-09 16:17:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865583849] [2025-01-09 16:17:35,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:35,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:17:35,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:17:35,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:35,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:35,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:35,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865583849] [2025-01-09 16:17:35,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865583849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:35,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:35,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:17:35,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762309046] [2025-01-09 16:17:35,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:35,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:17:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:35,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:17:35,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:17:35,922 INFO L87 Difference]: Start difference. First operand 186 states and 256 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:35,939 INFO L93 Difference]: Finished difference Result 319 states and 438 transitions. [2025-01-09 16:17:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:17:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-01-09 16:17:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:35,941 INFO L225 Difference]: With dead ends: 319 [2025-01-09 16:17:35,942 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 16:17:35,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:17:35,943 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:35,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 16:17:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-01-09 16:17:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 151 states have internal predecessors, (190), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 254 transitions. [2025-01-09 16:17:35,964 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 254 transitions. Word has length 136 [2025-01-09 16:17:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:35,964 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 254 transitions. [2025-01-09 16:17:35,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 254 transitions. [2025-01-09 16:17:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:17:35,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:35,966 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:35,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:17:35,966 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1413666339, now seen corresponding path program 1 times [2025-01-09 16:17:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48302466] [2025-01-09 16:17:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:35,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:17:36,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:17:36,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:36,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48302466] [2025-01-09 16:17:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48302466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:38,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:38,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:17:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360208368] [2025-01-09 16:17:38,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:38,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:17:38,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:38,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:17:38,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:17:38,200 INFO L87 Difference]: Start difference. First operand 186 states and 254 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 16:17:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:39,004 INFO L93 Difference]: Finished difference Result 357 states and 483 transitions. [2025-01-09 16:17:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:39,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2025-01-09 16:17:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:39,007 INFO L225 Difference]: With dead ends: 357 [2025-01-09 16:17:39,007 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 16:17:39,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:17:39,008 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 273 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:39,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 411 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:17:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 16:17:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 178. [2025-01-09 16:17:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 143 states have internal predecessors, (181), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 245 transitions. [2025-01-09 16:17:39,030 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 245 transitions. Word has length 136 [2025-01-09 16:17:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:39,031 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 245 transitions. [2025-01-09 16:17:39,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 16:17:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 245 transitions. [2025-01-09 16:17:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:17:39,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:39,032 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:17:39,032 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1299108296, now seen corresponding path program 1 times [2025-01-09 16:17:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315505536] [2025-01-09 16:17:39,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:39,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:17:39,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:17:39,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:39,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315505536] [2025-01-09 16:17:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315505536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:39,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:39,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:17:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448813365] [2025-01-09 16:17:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:39,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:39,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:39,121 INFO L87 Difference]: Start difference. First operand 178 states and 245 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:39,318 INFO L93 Difference]: Finished difference Result 303 states and 416 transitions. [2025-01-09 16:17:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:39,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-01-09 16:17:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:39,320 INFO L225 Difference]: With dead ends: 303 [2025-01-09 16:17:39,320 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 16:17:39,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-09 16:17:39,321 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 45 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:39,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 391 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:17:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 16:17:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-01-09 16:17:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 143 states have (on average 1.2587412587412588) internal successors, (180), 143 states have internal predecessors, (180), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 244 transitions. [2025-01-09 16:17:39,343 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 244 transitions. Word has length 137 [2025-01-09 16:17:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:39,344 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 244 transitions. [2025-01-09 16:17:39,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 244 transitions. [2025-01-09 16:17:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:17:39,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:39,345 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:39,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:17:39,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:39,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 287991046, now seen corresponding path program 1 times [2025-01-09 16:17:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27555557] [2025-01-09 16:17:39,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:39,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:39,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:17:39,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:17:39,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:39,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:40,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27555557] [2025-01-09 16:17:40,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27555557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:40,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:17:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411262860] [2025-01-09 16:17:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:40,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:17:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:40,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:17:40,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:17:40,660 INFO L87 Difference]: Start difference. First operand 178 states and 244 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 16:17:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:41,146 INFO L93 Difference]: Finished difference Result 305 states and 417 transitions. [2025-01-09 16:17:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2025-01-09 16:17:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:41,148 INFO L225 Difference]: With dead ends: 305 [2025-01-09 16:17:41,148 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 16:17:41,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:17:41,148 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 229 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:41,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 334 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:17:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 16:17:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 16:17:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 145 states have internal predecessors, (182), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2025-01-09 16:17:41,161 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 137 [2025-01-09 16:17:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:41,161 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2025-01-09 16:17:41,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 16:17:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2025-01-09 16:17:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:17:41,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:41,162 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:41,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:17:41,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:41,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1488863358, now seen corresponding path program 1 times [2025-01-09 16:17:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469453422] [2025-01-09 16:17:41,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:41,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:17:41,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:17:41,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:41,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:41,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:17:41,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469453422] [2025-01-09 16:17:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469453422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:17:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605908788] [2025-01-09 16:17:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:41,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:17:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:17:41,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:17:41,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:17:41,418 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:41,656 INFO L93 Difference]: Finished difference Result 185 states and 251 transitions. [2025-01-09 16:17:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:17:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-01-09 16:17:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:41,657 INFO L225 Difference]: With dead ends: 185 [2025-01-09 16:17:41,657 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 16:17:41,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:17:41,658 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 137 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:41,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 494 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:17:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 16:17:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-01-09 16:17:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.25) internal successors, (185), 148 states have internal predecessors, (185), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 16:17:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 249 transitions. [2025-01-09 16:17:41,672 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 249 transitions. Word has length 137 [2025-01-09 16:17:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:41,672 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 249 transitions. [2025-01-09 16:17:41,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2025-01-09 16:17:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:17:41,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:41,674 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:41,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:17:41,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1487016316, now seen corresponding path program 1 times [2025-01-09 16:17:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:17:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614169911] [2025-01-09 16:17:41,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:17:41,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:17:41,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:17:41,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:41,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:17:41,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:17:41,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:17:41,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:17:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:17:41,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:17:41,866 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:17:41,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:17:41,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:17:41,873 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:41,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:17:42,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:17:41 BoogieIcfgContainer [2025-01-09 16:17:42,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:17:42,003 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:17:42,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:17:42,003 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:17:42,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:26" (3/4) ... [2025-01-09 16:17:42,019 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:17:42,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:17:42,021 INFO L158 Benchmark]: Toolchain (without parser) took 16562.99ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 113.5MB in the beginning and 723.0MB in the end (delta: -609.5MB). Peak memory consumption was 456.2MB. Max. memory is 16.1GB. [2025-01-09 16:17:42,021 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:17:42,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.18ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 97.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:17:42,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.72ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:17:42,021 INFO L158 Benchmark]: Boogie Preprocessor took 44.94ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:17:42,021 INFO L158 Benchmark]: RCFGBuilder took 657.46ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 56.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:17:42,022 INFO L158 Benchmark]: TraceAbstraction took 15475.54ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 55.3MB in the beginning and 283.3MB in the end (delta: -228.0MB). Peak memory consumption was 388.7MB. Max. memory is 16.1GB. [2025-01-09 16:17:42,022 INFO L158 Benchmark]: Witness Printer took 16.79ms. Allocated memory is still 763.4MB. Free memory was 283.3MB in the beginning and 723.0MB in the end (delta: -439.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2025-01-09 16:17:42,023 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.18ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.18ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 97.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.72ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.94ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 657.46ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 56.3MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15475.54ms. Allocated memory was 142.6MB in the beginning and 763.4MB in the end (delta: 620.8MB). Free memory was 55.3MB in the beginning and 283.3MB in the end (delta: -228.0MB). Peak memory consumption was 388.7MB. Max. memory is 16.1GB. * Witness Printer took 16.79ms. Allocated memory is still 763.4MB. Free memory was 283.3MB in the beginning and 723.0MB in the end (delta: -439.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 122. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L57] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] unsigned short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L61] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L62] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L63] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned char last_1_WrapperStruct00_var_1_5 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=0, last_1_WrapperStruct00_var_1_5=1] [L137] isInitial = 1 [L138] FCALL initially() [L140] CALL updateLastVariables() [L130] EXPR WrapperStruct00.var_1_5 [L130] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L115] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L121] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L123] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L125] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L126] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L141] RET updateVariables() [L142] CALL step() [L76] COND FALSE !(! last_1_WrapperStruct00_var_1_5) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L82] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L91] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_1_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L93] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] COND FALSE !((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133-L134] return ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1389 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1386 mSDsluCounter, 7664 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5078 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2187 IncrementalHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 2586 mSDtfsCounter, 2187 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 281 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 3081 NumberOfCodeBlocks, 3081 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2922 ConstructedInterpolants, 0 QuantifiedInterpolants, 12962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1620 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10440/10560 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-01-09 16:17:42,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:17:44,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:17:44,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:17:44,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:17:44,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:17:44,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:17:44,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:17:44,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:17:44,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:17:44,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:17:44,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:17:44,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:17:44,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:17:44,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:17:44,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:17:44,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:44,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:44,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:17:44,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:17:44,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:17:44,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:17:44,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 [2025-01-09 16:17:44,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:17:44,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:17:44,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:17:44,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:17:44,540 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:17:44,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2025-01-09 16:17:45,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fdd5dc7/66226191fa0b448e83c1321687323e4e/FLAGaf8a68092 [2025-01-09 16:17:45,936 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:17:45,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2025-01-09 16:17:45,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fdd5dc7/66226191fa0b448e83c1321687323e4e/FLAGaf8a68092 [2025-01-09 16:17:45,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fdd5dc7/66226191fa0b448e83c1321687323e4e [2025-01-09 16:17:45,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:17:45,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:17:45,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:45,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:17:45,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:17:45,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:45" (1/1) ... [2025-01-09 16:17:45,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:45, skipping insertion in model container [2025-01-09 16:17:45,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:17:45" (1/1) ... [2025-01-09 16:17:45,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:17:46,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2025-01-09 16:17:46,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:46,167 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:17:46,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2025-01-09 16:17:46,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:17:46,235 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:17:46,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46 WrapperNode [2025-01-09 16:17:46,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:17:46,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:46,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:17:46,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:17:46,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,275 INFO L138 Inliner]: procedures = 40, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2025-01-09 16:17:46,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:17:46,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:17:46,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:17:46,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:17:46,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,308 INFO L175 MemorySlicer]: Split 128 memory accesses to 2 slices as follows [2, 126]. 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-01-09 16:17:46,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:17:46,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:17:46,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:17:46,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:17:46,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (1/1) ... [2025-01-09 16:17:46,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:17:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:17:46,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:17:46,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:17:46,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:17:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:17:46,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:17:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:17:46,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:17:46,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:17:46,565 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:17:46,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:17:48,179 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-01-09 16:17:48,179 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:17:48,193 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:17:48,193 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:17:48,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:48 BoogieIcfgContainer [2025-01-09 16:17:48,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:17:48,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:17:48,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:17:48,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:17:48,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:17:45" (1/3) ... [2025-01-09 16:17:48,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b93b971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:48, skipping insertion in model container [2025-01-09 16:17:48,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:17:46" (2/3) ... [2025-01-09 16:17:48,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b93b971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:17:48, skipping insertion in model container [2025-01-09 16:17:48,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:17:48" (3/3) ... [2025-01-09 16:17:48,201 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2025-01-09 16:17:48,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:17:48,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-96.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:17:48,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:17:48,250 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;@6c1621e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:17:48,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:17:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:48,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:48,270 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:48,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:48,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1026878523, now seen corresponding path program 1 times [2025-01-09 16:17:48,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:48,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465551807] [2025-01-09 16:17:48,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:48,281 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-01-09 16:17:48,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:48,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:17:48,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:17:48,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:48,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:48,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:48,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:48,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:17:48,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-01-09 16:17:48,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:48,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465551807] [2025-01-09 16:17:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465551807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:48,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:17:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332414627] [2025-01-09 16:17:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:48,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:17:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:17:48,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:17:48,662 INFO L87 Difference]: Start difference. First operand has 107 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 16:17:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:48,686 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2025-01-09 16:17:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:17:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-01-09 16:17:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:48,691 INFO L225 Difference]: With dead ends: 208 [2025-01-09 16:17:48,691 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 16:17:48,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-01-09 16:17:48,695 INFO L435 NwaCegarLoop]: 152 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, 152 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-01-09 16:17:48,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 16:17:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 16:17:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2025-01-09 16:17:48,722 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2025-01-09 16:17:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:48,722 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2025-01-09 16:17:48,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 16:17:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2025-01-09 16:17:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:48,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:48,724 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:48,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:17:48,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:17:48,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:48,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1194743519, now seen corresponding path program 1 times [2025-01-09 16:17:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555568299] [2025-01-09 16:17:48,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:48,930 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-01-09 16:17:48,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:48,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:17:48,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:17:49,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:49,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:49,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:49,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:49,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:17:49,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:49,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:49,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555568299] [2025-01-09 16:17:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555568299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:17:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877123961] [2025-01-09 16:17:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:49,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:17:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:49,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:17:49,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:49,242 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:49,294 INFO L93 Difference]: Finished difference Result 210 states and 308 transitions. [2025-01-09 16:17:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:17:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 16:17:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:49,296 INFO L225 Difference]: With dead ends: 210 [2025-01-09 16:17:49,297 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:17:49,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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-01-09 16:17:49,298 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 572 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:49,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 572 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:17:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:17:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-01-09 16:17:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-01-09 16:17:49,305 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2025-01-09 16:17:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:49,306 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-01-09 16:17:49,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-01-09 16:17:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:49,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:49,307 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:49,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:17:49,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:17:49,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:49,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1874801889, now seen corresponding path program 1 times [2025-01-09 16:17:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051566957] [2025-01-09 16:17:49,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:49,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:17:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:49,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:17:49,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:17:49,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:49,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:49,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:49,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:49,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:17:49,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:49,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:49,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:49,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051566957] [2025-01-09 16:17:49,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051566957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:49,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:49,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:17:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47395067] [2025-01-09 16:17:49,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:49,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:17:49,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:49,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:17:49,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:17:49,840 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:49,975 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-01-09 16:17:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:17:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 16:17:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:49,977 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:17:49,977 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 16:17:49,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-01-09 16:17:49,978 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 705 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:49,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 705 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:17:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 16:17:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-01-09 16:17:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-01-09 16:17:49,989 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2025-01-09 16:17:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:49,989 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-01-09 16:17:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-01-09 16:17:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:49,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:49,995 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:50,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 16:17:50,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:17:50,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:50,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash -645158045, now seen corresponding path program 1 times [2025-01-09 16:17:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151095606] [2025-01-09 16:17:50,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:50,197 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-01-09 16:17:50,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:50,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:17:50,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:17:50,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:50,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:50,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:50,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:50,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:17:50,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:52,790 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 9 treesize of output 5 [2025-01-09 16:17:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 16:17:52,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:17:52,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:17:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151095606] [2025-01-09 16:17:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151095606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:17:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:17:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:17:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301779627] [2025-01-09 16:17:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:17:52,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:17:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:17:52,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:17:52,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:17:52,819 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:17:53,064 INFO L93 Difference]: Finished difference Result 217 states and 313 transitions. [2025-01-09 16:17:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:17:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-01-09 16:17:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:17:53,071 INFO L225 Difference]: With dead ends: 217 [2025-01-09 16:17:53,071 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 16:17:53,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:17:53,072 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 85 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:17:53,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:17:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 16:17:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 16:17:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:17:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2025-01-09 16:17:53,089 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 131 [2025-01-09 16:17:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:17:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2025-01-09 16:17:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 16:17:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2025-01-09 16:17:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 16:17:53,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:17:53,091 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:17:53,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:17:53,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:17:53,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:17:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:17:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1960865509, now seen corresponding path program 1 times [2025-01-09 16:17:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:17:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026021271] [2025-01-09 16:17:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:17:53,293 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-01-09 16:17:53,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:17:53,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:17:53,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:17:53,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:17:53,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:17:53,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:17:53,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:17:53,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 16:17:53,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:17:55,113 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 12 treesize of output 8 [2025-01-09 16:17:55,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 16:17:56,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2025-01-09 16:17:57,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:17:57,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-01-09 16:17:58,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-01-09 16:17:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:17:59,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2025-01-09 16:17:59,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 68 [2025-01-09 16:17:59,562 INFO L349 Elim1Store]: treesize reduction 210, result has 6.7 percent of original size [2025-01-09 16:17:59,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 168 treesize of output 272 [2025-01-09 16:18:00,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 76 [2025-01-09 16:18:00,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 61 [2025-01-09 16:18:00,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 61 [2025-01-09 16:18:00,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 76 [2025-01-09 16:18:01,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:18:01,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 371 treesize of output 239 [2025-01-09 16:18:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 272 proven. 112 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 16:18:07,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:18:10,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:18:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026021271] [2025-01-09 16:18:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026021271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:18:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1045900060] [2025-01-09 16:18:10,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:18:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:18:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:18:10,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 16:18:10,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 16:18:11,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 16:18:11,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 16:18:11,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:18:11,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:18:11,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 16:18:11,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:18:13,709 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-01-09 16:18:14,759 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-01-09 16:18:15,656 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 12 treesize of output 8 [2025-01-09 16:18:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-01-09 16:18:17,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-01-09 16:18:18,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2025-01-09 16:18:23,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:18:28,739 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 0 case distinctions, treesize of input 42 treesize of output 50 [2025-01-09 16:18:29,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2025-01-09 16:18:29,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 47 [2025-01-09 16:18:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 212 proven. 112 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 16:18:29,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:18:32,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1045900060] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:18:32,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:18:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-01-09 16:18:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014955877] [2025-01-09 16:18:32,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:18:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:18:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:18:32,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:18:32,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=399, Unknown=19, NotChecked=0, Total=506 [2025-01-09 16:18:32,121 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 16 states have internal predecessors, (115), 9 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2025-01-09 16:18:34,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:18:35,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:18:36,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:18:39,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:18:50,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]