./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.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-ap_file-76.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 d023369b57015b0448fa000adefc11450489c47a7d6ec713392eb13d9ca97ac2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:38:42,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:38:42,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:38:42,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:38:42,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:38:42,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:38:42,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:38:42,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:38:42,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:38:42,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:38:42,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:38:42,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:38:42,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:38:42,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:38:42,387 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:38:42,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:38:42,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:38:42,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:38:42,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:38:42,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:38:42,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:38:42,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:38:42,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:38:42,390 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 -> d023369b57015b0448fa000adefc11450489c47a7d6ec713392eb13d9ca97ac2 [2025-01-09 15:38:42,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:38:42,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:38:42,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:38:42,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:38:42,663 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:38:42,665 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-ap_file-76.i [2025-01-09 15:38:43,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d585deae/f957111995c84ecba532b8a75bd10c81/FLAG97f5a9c2d [2025-01-09 15:38:44,132 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:38:44,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-76.i [2025-01-09 15:38:44,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d585deae/f957111995c84ecba532b8a75bd10c81/FLAG97f5a9c2d [2025-01-09 15:38:44,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d585deae/f957111995c84ecba532b8a75bd10c81 [2025-01-09 15:38:44,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:38:44,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:38:44,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:38:44,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:38:44,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:38:44,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44, skipping insertion in model container [2025-01-09 15:38:44,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:38:44,583 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-ap_file-76.i[917,930] [2025-01-09 15:38:44,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:38:44,652 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:38:44,661 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-ap_file-76.i[917,930] [2025-01-09 15:38:44,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:38:44,715 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:38:44,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44 WrapperNode [2025-01-09 15:38:44,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:38:44,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:38:44,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:38:44,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:38:44,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,768 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2025-01-09 15:38:44,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:38:44,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:38:44,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:38:44,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:38:44,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,810 INFO L175 MemorySlicer]: Split 107 memory accesses to 6 slices as follows [2, 40, 15, 38, 6, 6]. 37 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 2, 6, 1, 1]. [2025-01-09 15:38:44,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,825 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:38:44,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:38:44,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:38:44,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:38:44,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (1/1) ... [2025-01-09 15:38:44,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:38:44,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:44,885 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 15:38:44,895 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 15:38:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:38:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:38:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:38:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:38:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:38:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:38:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:38:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:38:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:38:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:38:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:38:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:38:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:38:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:38:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:38:44,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:38:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:38:44,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:38:45,053 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:38:45,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:38:45,469 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-01-09 15:38:45,469 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:38:45,478 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:38:45,480 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:38:45,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:38:45 BoogieIcfgContainer [2025-01-09 15:38:45,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:38:45,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:38:45,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:38:45,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:38:45,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:38:44" (1/3) ... [2025-01-09 15:38:45,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be75068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:38:45, skipping insertion in model container [2025-01-09 15:38:45,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:38:44" (2/3) ... [2025-01-09 15:38:45,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be75068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:38:45, skipping insertion in model container [2025-01-09 15:38:45,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:38:45" (3/3) ... [2025-01-09 15:38:45,491 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-76.i [2025-01-09 15:38:45,506 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:38:45,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-76.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:38:45,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:38:45,569 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;@130035e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:38:45,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:38:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:38:45,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:45,582 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:45,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:45,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash 98225285, now seen corresponding path program 1 times [2025-01-09 15:38:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618755119] [2025-01-09 15:38:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:45,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:38:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:38:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:38:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:45,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618755119] [2025-01-09 15:38:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618755119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358619012] [2025-01-09 15:38:45,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:45,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:45,890 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 15:38:45,892 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 15:38:46,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:38:46,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:38:46,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:46,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:46,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:38:46,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:38:46,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:38:46,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358619012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:46,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:38:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:38:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122790998] [2025-01-09 15:38:46,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:46,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:38:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:46,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:38:46,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:38:46,176 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:46,205 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-01-09 15:38:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:38:46,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-01-09 15:38:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:46,212 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:38:46,213 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 15:38:46,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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 15:38:46,219 INFO L435 NwaCegarLoop]: 133 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, 133 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 15:38:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 15:38:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 15:38:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-01-09 15:38:46,256 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2025-01-09 15:38:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:46,256 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-01-09 15:38:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-01-09 15:38:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:38:46,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:46,260 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:46,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:38:46,461 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 15:38:46,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash -442426475, now seen corresponding path program 1 times [2025-01-09 15:38:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290406419] [2025-01-09 15:38:46,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:46,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:38:46,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:38:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:46,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290406419] [2025-01-09 15:38:46,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290406419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:38:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092539276] [2025-01-09 15:38:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:38:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:46,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:38:46,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:38:46,738 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:46,762 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2025-01-09 15:38:46,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:38:46,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-01-09 15:38:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:46,764 INFO L225 Difference]: With dead ends: 185 [2025-01-09 15:38:46,764 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 15:38:46,764 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 15:38:46,765 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 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 15:38:46,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 15:38:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 15:38:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-01-09 15:38:46,775 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2025-01-09 15:38:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:46,777 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-01-09 15:38:46,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-01-09 15:38:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:38:46,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:46,780 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:46,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:38:46,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:46,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1260074925, now seen corresponding path program 1 times [2025-01-09 15:38:46,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:46,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721319649] [2025-01-09 15:38:46,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:46,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:46,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:38:46,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:38:46,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:46,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:46,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721319649] [2025-01-09 15:38:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721319649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:46,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:38:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623750223] [2025-01-09 15:38:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:46,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:38:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:46,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:38:46,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:38:46,990 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:47,001 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2025-01-09 15:38:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:38:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-01-09 15:38:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:47,003 INFO L225 Difference]: With dead ends: 185 [2025-01-09 15:38:47,003 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 15:38:47,004 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 15:38:47,004 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:47,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 15:38:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 15:38:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2025-01-09 15:38:47,010 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 119 [2025-01-09 15:38:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:47,011 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2025-01-09 15:38:47,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2025-01-09 15:38:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 15:38:47,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:47,013 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:47,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:38:47,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:47,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1740453400, now seen corresponding path program 1 times [2025-01-09 15:38:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699924918] [2025-01-09 15:38:47,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:47,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 15:38:47,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 15:38:47,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:47,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699924918] [2025-01-09 15:38:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699924918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:38:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978579285] [2025-01-09 15:38:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:48,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:38:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:48,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:38:48,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:38:48,189 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:48,466 INFO L93 Difference]: Finished difference Result 187 states and 261 transitions. [2025-01-09 15:38:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:38:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-01-09 15:38:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:48,470 INFO L225 Difference]: With dead ends: 187 [2025-01-09 15:38:48,472 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:38:48,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:38:48,473 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 178 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:48,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 403 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:38:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:38:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-01-09 15:38:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2025-01-09 15:38:48,484 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 120 [2025-01-09 15:38:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:48,484 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2025-01-09 15:38:48,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2025-01-09 15:38:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:38:48,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:48,487 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:48,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:38:48,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:48,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1779248685, now seen corresponding path program 1 times [2025-01-09 15:38:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004113725] [2025-01-09 15:38:48,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:48,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:38:48,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:38:48,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:48,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:38:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004113725] [2025-01-09 15:38:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004113725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470079366] [2025-01-09 15:38:48,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:48,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:48,667 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 15:38:48,669 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 15:38:48,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:38:48,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:38:48,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:48,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:38:48,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:48,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:38:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470079366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:38:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:38:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976498110] [2025-01-09 15:38:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:48,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:48,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:48,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:38:48,876 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:48,908 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2025-01-09 15:38:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:48,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-01-09 15:38:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:48,910 INFO L225 Difference]: With dead ends: 188 [2025-01-09 15:38:48,911 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:38:48,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 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 15:38:48,912 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:48,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 492 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:38:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:38:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-01-09 15:38:48,924 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 122 [2025-01-09 15:38:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:48,925 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-01-09 15:38:48,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-01-09 15:38:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:38:48,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:48,926 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:48,933 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 15:38:49,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:49,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:49,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1732456865, now seen corresponding path program 1 times [2025-01-09 15:38:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:49,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859459962] [2025-01-09 15:38:49,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:49,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:38:49,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:38:49,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:49,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:38:49,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:49,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859459962] [2025-01-09 15:38:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859459962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:49,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236045641] [2025-01-09 15:38:49,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:49,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:49,313 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 15:38:49,315 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 15:38:49,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:38:49,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:38:49,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:49,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:49,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:38:49,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:49,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:38:49,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236045641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:49,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:38:49,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:38:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498880872] [2025-01-09 15:38:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:38:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:49,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:38:49,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:38:49,493 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:49,531 INFO L93 Difference]: Finished difference Result 195 states and 268 transitions. [2025-01-09 15:38:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:38:49,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 15:38:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:49,533 INFO L225 Difference]: With dead ends: 195 [2025-01-09 15:38:49,533 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:38:49,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 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 15:38:49,534 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:49,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 610 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:38:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-01-09 15:38:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2025-01-09 15:38:49,547 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 124 [2025-01-09 15:38:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:49,547 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2025-01-09 15:38:49,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2025-01-09 15:38:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:38:49,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:49,550 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:49,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:38:49,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:49,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -685547300, now seen corresponding path program 1 times [2025-01-09 15:38:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342091789] [2025-01-09 15:38:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:49,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:38:49,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:38:49,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:49,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342091789] [2025-01-09 15:38:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342091789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:50,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:50,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:38:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938783025] [2025-01-09 15:38:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:38:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:50,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:38:50,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:38:50,224 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:50,437 INFO L93 Difference]: Finished difference Result 232 states and 317 transitions. [2025-01-09 15:38:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:38:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-01-09 15:38:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:50,438 INFO L225 Difference]: With dead ends: 232 [2025-01-09 15:38:50,438 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 15:38:50,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:38:50,439 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 215 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:50,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 426 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:38:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 15:38:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2025-01-09 15:38:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2025-01-09 15:38:50,448 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 126 [2025-01-09 15:38:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2025-01-09 15:38:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2025-01-09 15:38:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:38:50,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:50,449 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:38:50,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:50,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash 777944634, now seen corresponding path program 1 times [2025-01-09 15:38:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-01-09 15:38:50,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:38:50,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:38:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:50,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:50,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-01-09 15:38:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295332620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:38:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51563576] [2025-01-09 15:38:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:50,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:38:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:50,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:38:50,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:38:50,576 INFO L87 Difference]: Start difference. First operand 110 states and 151 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:50,619 INFO L93 Difference]: Finished difference Result 217 states and 299 transitions. [2025-01-09 15:38:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:38:50,619 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-01-09 15:38:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:50,620 INFO L225 Difference]: With dead ends: 217 [2025-01-09 15:38:50,620 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:38:50,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 15:38:50,621 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 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 15:38:50,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:38:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 15:38:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2025-01-09 15:38:50,628 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 126 [2025-01-09 15:38:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:50,629 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2025-01-09 15:38:50,629 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2025-01-09 15:38:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:38:50,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:50,630 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:38:50,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:50,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash 499009288, now seen corresponding path program 1 times [2025-01-09 15:38:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:50,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583718908] [2025-01-09 15:38:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:50,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:38:50,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:38:50,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:50,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:38:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583718908] [2025-01-09 15:38:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583718908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338519524] [2025-01-09 15:38:52,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:52,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:38:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:38:52,394 INFO L229 MonitoredProcess]: Starting monitored process 5 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 15:38:52,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:38:52,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:38:52,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:38:52,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:52,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:52,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 15:38:52,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:53,351 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 15:38:53,610 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 72 treesize of output 59 [2025-01-09 15:38:53,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:53,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 28 [2025-01-09 15:38:53,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:53,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 [2025-01-09 15:38:54,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:38:54,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:38:54,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 143 [2025-01-09 15:38:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:38:54,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:38:54,736 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 234 treesize of output 210 [2025-01-09 15:38:54,788 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 35 treesize of output 27 [2025-01-09 15:38:54,815 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 35 treesize of output 27 [2025-01-09 15:38:54,841 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 35 treesize of output 27 [2025-01-09 15:38:54,873 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 35 treesize of output 27 [2025-01-09 15:38:54,906 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 35 treesize of output 27 [2025-01-09 15:38:54,935 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 35 treesize of output 27 [2025-01-09 15:38:54,968 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 35 treesize of output 27 [2025-01-09 15:38:54,998 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 35 treesize of output 27 [2025-01-09 15:38:55,032 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 35 treesize of output 27 [2025-01-09 15:38:55,063 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 35 treesize of output 27 [2025-01-09 15:38:55,097 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 35 treesize of output 27 [2025-01-09 15:38:55,127 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 35 treesize of output 27 [2025-01-09 15:38:55,158 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 35 treesize of output 27 [2025-01-09 15:38:55,186 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 35 treesize of output 27 [2025-01-09 15:38:55,211 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 35 treesize of output 27 [2025-01-09 15:38:55,253 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 35 treesize of output 27 [2025-01-09 15:38:55,276 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 35 treesize of output 27 [2025-01-09 15:38:55,300 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 35 treesize of output 27 [2025-01-09 15:38:55,326 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 35 treesize of output 27 [2025-01-09 15:38:55,351 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 35 treesize of output 27 [2025-01-09 15:38:55,378 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 35 treesize of output 27 [2025-01-09 15:38:55,400 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 35 treesize of output 27 [2025-01-09 15:38:55,423 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 35 treesize of output 27 [2025-01-09 15:38:55,449 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 35 treesize of output 27 [2025-01-09 15:38:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338519524] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:38:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 10] total 24 [2025-01-09 15:38:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261847020] [2025-01-09 15:38:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:55,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:38:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:55,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:38:55,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:38:55,472 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:55,773 INFO L93 Difference]: Finished difference Result 302 states and 408 transitions. [2025-01-09 15:38:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:38:55,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-01-09 15:38:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:55,775 INFO L225 Difference]: With dead ends: 302 [2025-01-09 15:38:55,776 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 15:38:55,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 222 SyntacticMatches, 25 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:38:55,777 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 206 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:55,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 745 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:38:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 15:38:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2025-01-09 15:38:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 170 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:38:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2025-01-09 15:38:55,799 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 128 [2025-01-09 15:38:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:55,800 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2025-01-09 15:38:55,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2025-01-09 15:38:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:38:55,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:55,801 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:55,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:38:56,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 15:38:56,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 110734229, now seen corresponding path program 1 times [2025-01-09 15:38:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553803397] [2025-01-09 15:38:56,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:38:56,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:38:56,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:56,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:56,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553803397] [2025-01-09 15:38:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553803397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:56,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:38:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869650034] [2025-01-09 15:38:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:56,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:56,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:56,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:38:56,194 INFO L87 Difference]: Start difference. First operand 192 states and 259 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:56,289 INFO L93 Difference]: Finished difference Result 383 states and 517 transitions. [2025-01-09 15:38:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:56,290 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-01-09 15:38:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:56,292 INFO L225 Difference]: With dead ends: 383 [2025-01-09 15:38:56,292 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 15:38:56,292 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 15:38:56,293 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 11 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:56,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 452 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 15:38:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2025-01-09 15:38:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 170 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:38:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 257 transitions. [2025-01-09 15:38:56,312 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 257 transitions. Word has length 128 [2025-01-09 15:38:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:56,313 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 257 transitions. [2025-01-09 15:38:56,313 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 257 transitions. [2025-01-09 15:38:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:38:56,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:56,314 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:56,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:38:56,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:56,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1862326195, now seen corresponding path program 1 times [2025-01-09 15:38:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159423329] [2025-01-09 15:38:56,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:56,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:38:56,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:38:56,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159423329] [2025-01-09 15:38:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159423329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:56,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:38:56,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672349770] [2025-01-09 15:38:56,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:56,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:38:56,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:56,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:38:56,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:38:56,537 INFO L87 Difference]: Start difference. First operand 192 states and 257 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:56,708 INFO L93 Difference]: Finished difference Result 388 states and 516 transitions. [2025-01-09 15:38:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:38:56,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-01-09 15:38:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:56,711 INFO L225 Difference]: With dead ends: 388 [2025-01-09 15:38:56,711 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 15:38:56,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:38:56,712 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 183 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:56,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 622 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 15:38:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2025-01-09 15:38:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2025-01-09 15:38:56,724 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 208 transitions. Word has length 129 [2025-01-09 15:38:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:56,724 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 208 transitions. [2025-01-09 15:38:56,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2025-01-09 15:38:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:38:56,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:56,725 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:56,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:38:56,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:56,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1633675955, now seen corresponding path program 1 times [2025-01-09 15:38:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904369900] [2025-01-09 15:38:56,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:56,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:38:56,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:38:56,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:56,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904369900] [2025-01-09 15:38:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904369900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:57,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:57,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:38:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988297631] [2025-01-09 15:38:57,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:57,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:38:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:57,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:38:57,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:38:57,192 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:57,383 INFO L93 Difference]: Finished difference Result 214 states and 270 transitions. [2025-01-09 15:38:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:38:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-01-09 15:38:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:57,384 INFO L225 Difference]: With dead ends: 214 [2025-01-09 15:38:57,385 INFO L226 Difference]: Without dead ends: 212 [2025-01-09 15:38:57,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:38:57,385 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 189 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:57,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 605 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-09 15:38:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2025-01-09 15:38:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 180 states have (on average 1.2277777777777779) internal successors, (221), 180 states have internal predecessors, (221), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 251 transitions. [2025-01-09 15:38:57,402 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 251 transitions. Word has length 130 [2025-01-09 15:38:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:57,402 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 251 transitions. [2025-01-09 15:38:57,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 251 transitions. [2025-01-09 15:38:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:38:57,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:57,407 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:57,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:38:57,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:57,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:57,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1402934866, now seen corresponding path program 1 times [2025-01-09 15:38:57,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632107811] [2025-01-09 15:38:57,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:57,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:38:57,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:38:57,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:57,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632107811] [2025-01-09 15:38:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632107811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:38:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463843239] [2025-01-09 15:38:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:57,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:38:57,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:57,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:38:57,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:57,591 INFO L87 Difference]: Start difference. First operand 198 states and 251 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:57,757 INFO L93 Difference]: Finished difference Result 434 states and 553 transitions. [2025-01-09 15:38:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:38:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-01-09 15:38:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:57,759 INFO L225 Difference]: With dead ends: 434 [2025-01-09 15:38:57,759 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 15:38:57,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:38:57,763 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 200 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:57,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 462 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 15:38:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 198. [2025-01-09 15:38:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 180 states have (on average 1.2166666666666666) internal successors, (219), 180 states have internal predecessors, (219), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2025-01-09 15:38:57,782 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 130 [2025-01-09 15:38:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:57,782 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2025-01-09 15:38:57,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2025-01-09 15:38:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 15:38:57,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:57,786 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:57,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:38:57,786 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:57,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash -635223123, now seen corresponding path program 1 times [2025-01-09 15:38:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:57,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472997534] [2025-01-09 15:38:57,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:57,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:57,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 15:38:57,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 15:38:57,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:57,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472997534] [2025-01-09 15:38:58,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472997534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:58,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:58,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:38:58,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249151092] [2025-01-09 15:38:58,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:58,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:38:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:58,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:38:58,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:38:58,087 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:58,398 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2025-01-09 15:38:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:38:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-01-09 15:38:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:58,402 INFO L225 Difference]: With dead ends: 444 [2025-01-09 15:38:58,402 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 15:38:58,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:38:58,403 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 255 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:58,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 504 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:38:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 15:38:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 200. [2025-01-09 15:38:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 182 states have (on average 1.2032967032967032) internal successors, (219), 182 states have internal predecessors, (219), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2025-01-09 15:38:58,435 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 130 [2025-01-09 15:38:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:58,435 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2025-01-09 15:38:58,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2025-01-09 15:38:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:38:58,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:58,437 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:58,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:38:58,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:58,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1220412519, now seen corresponding path program 1 times [2025-01-09 15:38:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:58,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809379349] [2025-01-09 15:38:58,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:58,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:38:58,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:38:58,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:58,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809379349] [2025-01-09 15:38:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809379349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:58,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:58,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:38:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953299598] [2025-01-09 15:38:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:58,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:38:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:58,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:38:58,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:38:58,773 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:59,126 INFO L93 Difference]: Finished difference Result 514 states and 642 transitions. [2025-01-09 15:38:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:38:59,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:38:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:59,128 INFO L225 Difference]: With dead ends: 514 [2025-01-09 15:38:59,128 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 15:38:59,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:38:59,130 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 242 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:59,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1169 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:38:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 15:38:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 258. [2025-01-09 15:38:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 240 states have (on average 1.2083333333333333) internal successors, (290), 240 states have internal predecessors, (290), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 320 transitions. [2025-01-09 15:38:59,146 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 320 transitions. Word has length 131 [2025-01-09 15:38:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 320 transitions. [2025-01-09 15:38:59,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:38:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 320 transitions. [2025-01-09 15:38:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:38:59,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:59,147 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:59,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:38:59,148 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:59,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1729885609, now seen corresponding path program 1 times [2025-01-09 15:38:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:59,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96219521] [2025-01-09 15:38:59,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:59,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:38:59,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:38:59,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96219521] [2025-01-09 15:38:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96219521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:38:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138649913] [2025-01-09 15:38:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:59,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:59,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:38:59,289 INFO L87 Difference]: Start difference. First operand 258 states and 320 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:59,365 INFO L93 Difference]: Finished difference Result 536 states and 665 transitions. [2025-01-09 15:38:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:38:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:59,368 INFO L225 Difference]: With dead ends: 536 [2025-01-09 15:38:59,368 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 15:38:59,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:38:59,369 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:59,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 439 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:38:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 15:38:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 226. [2025-01-09 15:38:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 208 states have internal predecessors, (251), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 281 transitions. [2025-01-09 15:38:59,384 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 281 transitions. Word has length 131 [2025-01-09 15:38:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:59,385 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 281 transitions. [2025-01-09 15:38:59,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 281 transitions. [2025-01-09 15:38:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:38:59,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:59,387 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:38:59,387 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:59,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2145946533, now seen corresponding path program 1 times [2025-01-09 15:38:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718354034] [2025-01-09 15:38:59,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:59,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:38:59,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:38:59,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:59,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:38:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:38:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718354034] [2025-01-09 15:38:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718354034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:38:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:38:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:38:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524244882] [2025-01-09 15:38:59,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:38:59,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:38:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:38:59,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:38:59,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:38:59,499 INFO L87 Difference]: Start difference. First operand 226 states and 281 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:38:59,553 INFO L93 Difference]: Finished difference Result 427 states and 531 transitions. [2025-01-09 15:38:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:38:59,554 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-01-09 15:38:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:38:59,555 INFO L225 Difference]: With dead ends: 427 [2025-01-09 15:38:59,555 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 15:38:59,555 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 15:38:59,556 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:38:59,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 449 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:38:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 15:38:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-09 15:38:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 186 states have internal predecessors, (221), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:38:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2025-01-09 15:38:59,568 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 132 [2025-01-09 15:38:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:38:59,568 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2025-01-09 15:38:59,568 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:38:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2025-01-09 15:38:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:38:59,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:38:59,570 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:59,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:38:59,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:38:59,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:38:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1122685160, now seen corresponding path program 1 times [2025-01-09 15:38:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:38:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556691318] [2025-01-09 15:38:59,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:38:59,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:38:59,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:38:59,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:59,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:39:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556691318] [2025-01-09 15:39:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556691318] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:39:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382358231] [2025-01-09 15:39:00,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:00,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:39:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:39:00,013 INFO L229 MonitoredProcess]: Starting monitored process 6 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 15:39:00,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:39:00,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:39:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:39:00,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:00,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:00,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:39:00,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:39:00,322 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 15:39:00,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:39:00,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-01-09 15:39:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 11 proven. 177 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 15:39:01,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:39:01,340 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 31 treesize of output 27 [2025-01-09 15:39:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:39:01,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382358231] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:39:01,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:39:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2025-01-09 15:39:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461970887] [2025-01-09 15:39:01,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:39:01,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 15:39:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:01,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 15:39:01,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:39:01,388 INFO L87 Difference]: Start difference. First operand 204 states and 251 transitions. Second operand has 25 states, 22 states have (on average 6.181818181818182) internal successors, (136), 24 states have internal predecessors, (136), 11 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) [2025-01-09 15:39:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:01,942 INFO L93 Difference]: Finished difference Result 329 states and 402 transitions. [2025-01-09 15:39:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:39:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.181818181818182) internal successors, (136), 24 states have internal predecessors, (136), 11 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) Word has length 132 [2025-01-09 15:39:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:01,944 INFO L225 Difference]: With dead ends: 329 [2025-01-09 15:39:01,944 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 15:39:01,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 15:39:01,945 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 330 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:01,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 490 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:39:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 15:39:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2025-01-09 15:39:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.101010101010101) internal successors, (109), 100 states have internal predecessors, (109), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2025-01-09 15:39:01,973 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 132 [2025-01-09 15:39:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:01,973 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2025-01-09 15:39:01,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.181818181818182) internal successors, (136), 24 states have internal predecessors, (136), 11 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) [2025-01-09 15:39:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2025-01-09 15:39:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:39:01,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:01,974 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:39:01,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:39:02,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 15:39:02,175 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash 19374095, now seen corresponding path program 1 times [2025-01-09 15:39:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405990704] [2025-01-09 15:39:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:02,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:39:02,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:39:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:39:02,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405990704] [2025-01-09 15:39:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405990704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:39:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:39:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43679184] [2025-01-09 15:39:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:02,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:39:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:02,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:39:02,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:39:02,224 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:39:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:02,243 INFO L93 Difference]: Finished difference Result 233 states and 278 transitions. [2025-01-09 15:39:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:39:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:39:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:02,245 INFO L225 Difference]: With dead ends: 233 [2025-01-09 15:39:02,245 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 15:39:02,246 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 15:39:02,246 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:39:02,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 15:39:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 15:39:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.1) internal successors, (110), 101 states have internal predecessors, (110), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:39:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2025-01-09 15:39:02,260 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 133 [2025-01-09 15:39:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:02,262 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2025-01-09 15:39:02,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:39:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2025-01-09 15:39:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:39:02,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:39:02,263 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:39:02,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:39:02,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:39:02,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:39:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -789972531, now seen corresponding path program 1 times [2025-01-09 15:39:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:39:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046175775] [2025-01-09 15:39:02,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:39:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:39:02,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:39:02,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:39:02,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:39:02,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:39:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:39:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:39:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046175775] [2025-01-09 15:39:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046175775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:39:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:39:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:39:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483664712] [2025-01-09 15:39:02,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:39:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:39:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:39:02,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:39:02,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:39:02,420 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:39:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:39:02,464 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2025-01-09 15:39:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:39:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:39:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:39:02,465 INFO L225 Difference]: With dead ends: 222 [2025-01-09 15:39:02,465 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 15:39:02,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:39:02,465 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 255 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 15:39:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 255 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:39:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 15:39:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 15:39:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 15:39:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 15:39:02,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2025-01-09 15:39:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:39:02,466 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 15:39:02,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:39:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 15:39:02,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 15:39:02,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:39:02,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:39:02,472 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 15:39:02,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 15:39:07,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:39:07,796 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,801 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-01-09 15:39:07,802 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 15:39:07,802 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 15:39:07,802 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,803 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base [2025-01-09 15:39:07,803 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,803 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,803 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset [2025-01-09 15:39:07,803 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2025-01-09 15:39:07,804 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]] [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,806 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,807 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,808 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-01-09 15:39:07,809 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,810 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]] [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,811 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,813 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,814 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,814 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-01-09 15:39:07,814 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,814 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,815 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,816 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,817 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!base [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!offset [2025-01-09 15:39:07,818 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset [2025-01-09 15:39:07,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:39:07 BoogieIcfgContainer [2025-01-09 15:39:07,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:39:07,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:39:07,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:39:07,819 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:39:07,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:38:45" (3/4) ... [2025-01-09 15:39:07,822 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 15:39:07,826 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-09 15:39:07,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 15:39:07,835 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 15:39:07,836 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 15:39:07,836 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 15:39:07,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 15:39:07,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 15:39:07,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:39:07,918 INFO L158 Benchmark]: Toolchain (without parser) took 23460.78ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 128.0MB in the beginning and 517.2MB in the end (delta: -389.2MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2025-01-09 15:39:07,919 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:39:07,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.04ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 113.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:39:07,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.97ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 110.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:39:07,920 INFO L158 Benchmark]: Boogie Preprocessor took 80.57ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 106.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:39:07,920 INFO L158 Benchmark]: RCFGBuilder took 630.77ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 75.6MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:39:07,921 INFO L158 Benchmark]: TraceAbstraction took 22335.44ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 74.7MB in the beginning and 529.6MB in the end (delta: -454.9MB). Peak memory consumption was 356.5MB. Max. memory is 16.1GB. [2025-01-09 15:39:07,921 INFO L158 Benchmark]: Witness Printer took 99.15ms. Allocated memory is still 696.3MB. Free memory was 529.6MB in the beginning and 517.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:39:07,922 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.31ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.04ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 113.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.97ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 110.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.57ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 106.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 630.77ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 75.6MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22335.44ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 74.7MB in the beginning and 529.6MB in the end (delta: -454.9MB). Peak memory consumption was 356.5MB. Max. memory is 16.1GB. * Witness Printer took 99.15ms. Allocated memory is still 696.3MB. Free memory was 529.6MB in the beginning and 517.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[ArrayStoreExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]],ArrayStoreExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset,GLOBAL]],BinaryExpression[ARITHPLUS,IntegerLiteral[-256],BinaryExpression[ARITHMOD,BinaryExpression[ARITHPLUS,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!offset,GLOBAL]]],IntegerLiteral[240]],IntegerLiteral[256]]]]],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#double_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#BOOL_unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer~0!offset * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2058 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2058 mSDsluCounter, 9341 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6818 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2441 IncrementalHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 2523 mSDtfsCounter, 2441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1073 GetRequests, 876 SyntacticMatches, 27 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=15, InterpolantAutomatonStates: 123, 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, 20 MinimizatonAttempts, 303 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 3167 NumberOfCodeBlocks, 3167 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3400 ConstructedInterpolants, 1 QuantifiedInterpolants, 18700 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2383 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 10751/11340 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 15:39:07,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE