./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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_codestructure_dependencies_file-59.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', '07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89'] 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_codestructure_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:58:26,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:58:26,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:58:26,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:58:26,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:58:26,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:58:26,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:58:26,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:58:26,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:58:26,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:58:26,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:58:26,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:58:26,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:58:26,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:58:26,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:58:26,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:58:26,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:58:26,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:58:26,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:58:26,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:58:26,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:58:26,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:58:26,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:58:26,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:58:26,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:58:26,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:58:26,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:58:26,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:58:26,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:58:26,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:58:26,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:58:26,821 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2024-11-07 03:58:27,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:58:27,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:58:27,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:58:27,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:58:27,110 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:58:27,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2024-11-07 03:58:28,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:58:28,625 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:58:28,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2024-11-07 03:58:28,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92517aa71/5c5ad36b4bd7440997169ee200f2ffe2/FLAGc23042e5d [2024-11-07 03:58:28,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92517aa71/5c5ad36b4bd7440997169ee200f2ffe2 [2024-11-07 03:58:28,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:58:28,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:58:28,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:58:28,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:58:28,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:58:28,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:28" (1/1) ... [2024-11-07 03:58:28,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb8fa8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:28, skipping insertion in model container [2024-11-07 03:58:28,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:28" (1/1) ... [2024-11-07 03:58:28,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:58:29,092 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_codestructure_dependencies_file-59.i[919,932] [2024-11-07 03:58:29,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:58:29,148 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:58:29,158 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_codestructure_dependencies_file-59.i[919,932] [2024-11-07 03:58:29,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:58:29,200 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:58:29,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29 WrapperNode [2024-11-07 03:58:29,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:58:29,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:58:29,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:58:29,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:58:29,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,250 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-07 03:58:29,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:58:29,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:58:29,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:58:29,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:58:29,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 03:58:29,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:58:29,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:58:29,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:58:29,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:58:29,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (1/1) ... [2024-11-07 03:58:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:58:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:58:29,366 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 03:58:29,371 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 03:58:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:58:29,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:58:29,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:58:29,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:58:29,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:58:29,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:58:29,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:58:29,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:58:29,759 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:58:29,759 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:58:29,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:58:29,773 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:58:29,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:29 BoogieIcfgContainer [2024-11-07 03:58:29,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:58:29,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:58:29,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:58:29,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:58:29,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:58:28" (1/3) ... [2024-11-07 03:58:29,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7350f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:29, skipping insertion in model container [2024-11-07 03:58:29,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:29" (2/3) ... [2024-11-07 03:58:29,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7350f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:29, skipping insertion in model container [2024-11-07 03:58:29,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:29" (3/3) ... [2024-11-07 03:58:29,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2024-11-07 03:58:29,799 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:58:29,799 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:58:29,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:58:29,893 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;@26706402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:58:29,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:58:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 03:58:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 03:58:29,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:29,912 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:29,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:29,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1955902165, now seen corresponding path program 1 times [2024-11-07 03:58:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:58:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411425744] [2024-11-07 03:58:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:58:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:58:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:58:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:58:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:58:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:58:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:58:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:58:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:58:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:58:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 03:58:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 03:58:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:58:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:58:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:58:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 03:58:30,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:58:30,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411425744] [2024-11-07 03:58:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411425744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:58:30,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:58:30,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:58:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130281991] [2024-11-07 03:58:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:58:30,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:58:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:58:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:58:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:58:30,313 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 03:58:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:58:30,343 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-07 03:58:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:58:30,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-11-07 03:58:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:58:30,353 INFO L225 Difference]: With dead ends: 97 [2024-11-07 03:58:30,353 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 03:58:30,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 03:58:30,361 INFO L432 NwaCegarLoop]: 71 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, 71 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 03:58:30,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:58:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 03:58:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 03:58:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 03:58:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-07 03:58:30,411 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2024-11-07 03:58:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:58:30,411 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-07 03:58:30,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 03:58:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-07 03:58:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 03:58:30,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:30,415 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:30,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:58:30,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:30,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1839626269, now seen corresponding path program 1 times [2024-11-07 03:58:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:58:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265748669] [2024-11-07 03:58:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:58:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:58:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:58:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:58:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:58:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:58:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:58:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:58:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:58:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:58:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 03:58:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 03:58:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:58:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:58:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:58:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 03:58:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:58:30,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265748669] [2024-11-07 03:58:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265748669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:58:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:58:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:58:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743691838] [2024-11-07 03:58:30,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:58:30,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:58:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:58:31,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:58:31,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:58:31,001 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 03:58:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:58:31,181 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-07 03:58:31,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:58:31,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-07 03:58:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:58:31,183 INFO L225 Difference]: With dead ends: 139 [2024-11-07 03:58:31,184 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 03:58:31,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:58:31,185 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:58:31,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:58:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 03:58:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-11-07 03:58:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 03:58:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-11-07 03:58:31,205 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2024-11-07 03:58:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:58:31,206 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-11-07 03:58:31,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 03:58:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-11-07 03:58:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 03:58:31,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:31,211 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:31,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:58:31,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1210698047, now seen corresponding path program 1 times [2024-11-07 03:58:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:58:31,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774121176] [2024-11-07 03:58:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:58:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:58:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:58:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 03:58:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:58:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 03:58:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:58:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 03:58:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:58:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:58:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 03:58:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 03:58:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:58:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 03:58:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:58:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 03:58:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:58:31,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774121176] [2024-11-07 03:58:31,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774121176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:58:31,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:58:31,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:58:31,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738451103] [2024-11-07 03:58:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:58:31,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:58:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:58:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:58:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:58:31,619 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 03:58:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:58:31,793 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2024-11-07 03:58:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:58:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-07 03:58:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:58:31,796 INFO L225 Difference]: With dead ends: 176 [2024-11-07 03:58:31,796 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 03:58:31,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:58:31,797 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:58:31,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 253 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:58:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 03:58:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2024-11-07 03:58:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 03:58:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2024-11-07 03:58:31,835 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2024-11-07 03:58:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:58:31,837 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2024-11-07 03:58:31,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 03:58:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2024-11-07 03:58:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 03:58:31,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:58:31,839 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:58:31,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:58:31,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:58:31,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:58:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1799611305, now seen corresponding path program 1 times [2024-11-07 03:58:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:58:31,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135798109] [2024-11-07 03:58:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:58:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 03:58:31,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658922113] [2024-11-07 03:58:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:58:31,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:58:31,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:58:31,979 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 03:58:31,981 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 03:58:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:58:32,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 03:58:32,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:58:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-07 03:58:34,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:58:40,112 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 03:58:52,455 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 03:59:07,595 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 03:59:23,868 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 03:59:31,685 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 03:59:47,716 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)