./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0'] 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-a_file-39.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 d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:12:21,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:12:21,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:12:21,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:12:21,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:12:21,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:12:21,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:12:21,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:12:21,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:12:21,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:12:21,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:12:21,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:12:21,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:12:21,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:12:21,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:12:21,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:12:21,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:12:21,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:12:21,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:12:21,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:12:21,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:12:21,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:12:21,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:12:21,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:12:21,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:12:21,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:12:21,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:12:21,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:12:21,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:12:21,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:12:21,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:12:21,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:12:21,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:12:21,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:12:21,629 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 -> d2a0584d4779790e33dcddf636884f56e9964183aa5c7648270a93d40ce062b0 [2024-11-07 10:12:21,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:12:21,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:12:21,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:12:21,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:12:21,889 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:12:21,890 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-a_file-39.i [2024-11-07 10:12:23,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:12:23,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:12:23,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-39.i [2024-11-07 10:12:23,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fa979b65/d8fa4bd374e34b6093ec489cf0ed76c2/FLAG2262cc0c9 [2024-11-07 10:12:23,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fa979b65/d8fa4bd374e34b6093ec489cf0ed76c2 [2024-11-07 10:12:23,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:12:23,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:12:23,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:12:23,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:12:23,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:12:23,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:23,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a03e292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23, skipping insertion in model container [2024-11-07 10:12:23,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:23,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:12:23,821 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-a_file-39.i[916,929] [2024-11-07 10:12:23,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:12:23,886 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:12:23,897 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-a_file-39.i[916,929] [2024-11-07 10:12:23,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:12:23,959 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:12:23,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23 WrapperNode [2024-11-07 10:12:23,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:12:23,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:12:23,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:12:23,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:12:23,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:23,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,046 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 604 [2024-11-07 10:12:24,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:12:24,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:12:24,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:12:24,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:12:24,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,103 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2024-11-07 10:12:24,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:12:24,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:12:24,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:12:24,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:12:24,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (1/1) ... [2024-11-07 10:12:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:12:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:12:24,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:12:24,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:12:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:12:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:12:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:12:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:12:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:12:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:12:24,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:12:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:12:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:12:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:12:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:12:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:12:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:12:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:12:24,368 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:12:24,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:12:24,936 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-07 10:12:24,937 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:12:24,948 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:12:24,949 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:12:24,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:24 BoogieIcfgContainer [2024-11-07 10:12:24,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:12:24,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:12:24,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:12:24,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:12:24,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:12:23" (1/3) ... [2024-11-07 10:12:24,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d524bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:24, skipping insertion in model container [2024-11-07 10:12:24,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:23" (2/3) ... [2024-11-07 10:12:24,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d524bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:24, skipping insertion in model container [2024-11-07 10:12:24,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:24" (3/3) ... [2024-11-07 10:12:24,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-39.i [2024-11-07 10:12:24,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:12:24,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:12:25,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:12:25,042 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;@76c17bbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:12:25,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:12:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:12:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:12:25,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:25,061 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:25,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:25,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1938211499, now seen corresponding path program 1 times [2024-11-07 10:12:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:25,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453669918] [2024-11-07 10:12:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:12:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:12:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:12:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:12:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:12:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:12:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:12:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:12:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:12:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:12:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:12:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:12:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:12:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:12:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:12:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:12:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:12:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:12:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453669918] [2024-11-07 10:12:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453669918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:12:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:12:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:12:25,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060864779] [2024-11-07 10:12:25,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:25,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:12:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:12:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:12:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:12:25,508 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:25,537 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-07 10:12:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:12:25,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-07 10:12:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:25,546 INFO L225 Difference]: With dead ends: 233 [2024-11-07 10:12:25,547 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 10:12:25,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:12:25,553 INFO L432 NwaCegarLoop]: 170 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, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:25,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:12:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 10:12:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-07 10:12:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:12:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-07 10:12:25,591 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-07 10:12:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:25,591 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-07 10:12:25,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-07 10:12:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:12:25,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:25,595 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:25,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:12:25,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:25,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash -321601841, now seen corresponding path program 1 times [2024-11-07 10:12:25,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:25,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163965235] [2024-11-07 10:12:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:12:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:12:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:12:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:12:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:12:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:12:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:12:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:12:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:12:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:12:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:12:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:12:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:12:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:12:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:12:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:12:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:12:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:12:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163965235] [2024-11-07 10:12:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163965235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:12:29,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:12:29,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:12:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873811608] [2024-11-07 10:12:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:29,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:12:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:12:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:12:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:12:29,654 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:31,641 INFO L93 Difference]: Finished difference Result 390 states and 571 transitions. [2024-11-07 10:12:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 10:12:31,642 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-07 10:12:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:31,644 INFO L225 Difference]: With dead ends: 390 [2024-11-07 10:12:31,644 INFO L226 Difference]: Without dead ends: 277 [2024-11-07 10:12:31,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:12:31,646 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 298 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:31,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1794 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 10:12:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-07 10:12:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2024-11-07 10:12:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.4351464435146444) internal successors, (343), 241 states have internal predecessors, (343), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:12:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 399 transitions. [2024-11-07 10:12:31,703 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 399 transitions. Word has length 128 [2024-11-07 10:12:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:31,704 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 399 transitions. [2024-11-07 10:12:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 399 transitions. [2024-11-07 10:12:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:12:31,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:31,706 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:31,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:12:31,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:31,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash 358456529, now seen corresponding path program 1 times [2024-11-07 10:12:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:31,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370686010] [2024-11-07 10:12:31,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:12:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:12:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:12:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:12:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:12:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:12:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:12:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:12:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:12:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:12:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:12:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:12:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:12:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:12:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:12:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:12:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:12:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:12:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370686010] [2024-11-07 10:12:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370686010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:12:32,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:12:32,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:12:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421344323] [2024-11-07 10:12:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:32,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:12:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:12:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:12:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:12:32,492 INFO L87 Difference]: Start difference. First operand 271 states and 399 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:32,994 INFO L93 Difference]: Finished difference Result 629 states and 924 transitions. [2024-11-07 10:12:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:12:32,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-07 10:12:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:32,999 INFO L225 Difference]: With dead ends: 629 [2024-11-07 10:12:32,999 INFO L226 Difference]: Without dead ends: 361 [2024-11-07 10:12:33,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:12:33,004 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 127 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:33,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 775 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:12:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-07 10:12:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 297. [2024-11-07 10:12:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 264 states have (on average 1.4318181818181819) internal successors, (378), 266 states have internal predecessors, (378), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:12:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 434 transitions. [2024-11-07 10:12:33,040 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 434 transitions. Word has length 128 [2024-11-07 10:12:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:33,040 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 434 transitions. [2024-11-07 10:12:33,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 434 transitions. [2024-11-07 10:12:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:12:33,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:33,042 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:33,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:12:33,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1909949743, now seen corresponding path program 1 times [2024-11-07 10:12:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923997250] [2024-11-07 10:12:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:12:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:12:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:12:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:12:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:12:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:12:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:12:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:12:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:12:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:12:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:12:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:12:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:12:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:12:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:12:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:12:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:12:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:12:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923997250] [2024-11-07 10:12:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923997250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:12:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:12:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:12:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919680499] [2024-11-07 10:12:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:33,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:12:33,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:12:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:12:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:12:33,704 INFO L87 Difference]: Start difference. First operand 297 states and 434 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-07 10:12:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:34,281 INFO L93 Difference]: Finished difference Result 599 states and 871 transitions. [2024-11-07 10:12:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:12:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-11-07 10:12:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:34,285 INFO L225 Difference]: With dead ends: 599 [2024-11-07 10:12:34,285 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 10:12:34,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:12:34,286 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 124 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:34,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1223 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:12:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 10:12:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 239. [2024-11-07 10:12:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 211 states have (on average 1.4170616113744077) internal successors, (299), 212 states have internal predecessors, (299), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 10:12:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 345 transitions. [2024-11-07 10:12:34,317 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 345 transitions. Word has length 128 [2024-11-07 10:12:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:34,318 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 345 transitions. [2024-11-07 10:12:34,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-07 10:12:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 345 transitions. [2024-11-07 10:12:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:12:34,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:34,322 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:34,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:12:34,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:34,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1229891373, now seen corresponding path program 1 times [2024-11-07 10:12:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755493928] [2024-11-07 10:12:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:12:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:12:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:12:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:12:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:12:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:12:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:12:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:12:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:12:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:12:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:12:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:12:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:12:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:12:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:12:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:12:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 10:12:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:12:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755493928] [2024-11-07 10:12:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755493928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:12:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600897518] [2024-11-07 10:12:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:12:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:12:35,780 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) [2024-11-07 10:12:35,785 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 [2024-11-07 10:12:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:36,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-07 10:12:36,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:12:36,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 10:12:36,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 10:12:36,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2024-11-07 10:12:37,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 122 [2024-11-07 10:12:37,902 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 19 treesize of output 15 [2024-11-07 10:12:38,056 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 25 treesize of output 13 [2024-11-07 10:12:38,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:12:38,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 187 treesize of output 67 [2024-11-07 10:12:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 372 proven. 45 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 10:12:38,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:12:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:12:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600897518] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:12:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:12:39,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 37] total 57 [2024-11-07 10:12:39,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91634418] [2024-11-07 10:12:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:39,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:12:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:12:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:12:39,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2804, Unknown=0, NotChecked=0, Total=3192 [2024-11-07 10:12:39,991 INFO L87 Difference]: Start difference. First operand 239 states and 345 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:12:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:41,906 INFO L93 Difference]: Finished difference Result 655 states and 948 transitions. [2024-11-07 10:12:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:12:41,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:12:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:41,910 INFO L225 Difference]: With dead ends: 655 [2024-11-07 10:12:41,910 INFO L226 Difference]: Without dead ends: 419 [2024-11-07 10:12:41,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=501, Invalid=3789, Unknown=0, NotChecked=0, Total=4290 [2024-11-07 10:12:41,913 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 707 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:41,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1911 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:12:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-07 10:12:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 247. [2024-11-07 10:12:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 219 states have (on average 1.4109589041095891) internal successors, (309), 220 states have internal predecessors, (309), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 10:12:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 355 transitions. [2024-11-07 10:12:41,952 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 355 transitions. Word has length 128 [2024-11-07 10:12:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:41,952 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 355 transitions. [2024-11-07 10:12:41,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:12:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 355 transitions. [2024-11-07 10:12:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:12:41,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:41,954 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:41,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:12:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:12:42,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2071281815, now seen corresponding path program 1 times [2024-11-07 10:12:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386684314] [2024-11-07 10:12:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:12:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:12:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:12:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:12:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:12:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:12:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:12:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:12:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:12:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:12:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:12:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:12:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:12:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:12:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:12:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:12:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:12:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:12:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:12:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386684314] [2024-11-07 10:12:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386684314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:12:43,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:12:43,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:12:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522825284] [2024-11-07 10:12:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:12:43,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:12:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:12:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:12:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:12:43,878 INFO L87 Difference]: Start difference. First operand 247 states and 355 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:12:45,440 INFO L93 Difference]: Finished difference Result 494 states and 709 transitions. [2024-11-07 10:12:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:12:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-07 10:12:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:12:45,443 INFO L225 Difference]: With dead ends: 494 [2024-11-07 10:12:45,443 INFO L226 Difference]: Without dead ends: 250 [2024-11-07 10:12:45,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:12:45,445 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 303 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:12:45,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1248 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:12:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-07 10:12:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 241. [2024-11-07 10:12:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.4131455399061033) internal successors, (301), 214 states have internal predecessors, (301), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 10:12:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 347 transitions. [2024-11-07 10:12:45,473 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 347 transitions. Word has length 129 [2024-11-07 10:12:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:12:45,474 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 347 transitions. [2024-11-07 10:12:45,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:12:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 347 transitions. [2024-11-07 10:12:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:12:45,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:12:45,478 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:12:45,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:12:45,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:12:45,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:12:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash 909599145, now seen corresponding path program 1 times [2024-11-07 10:12:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:12:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911481381] [2024-11-07 10:12:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:12:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:12:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat