./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.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_operatoramount_amount10_file-90.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', '213a6773a680bcbd913164a5664bc5a26b44f83b15a409d83afc4623b719c3ae'] 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_operatoramount_amount10_file-90.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 213a6773a680bcbd913164a5664bc5a26b44f83b15a409d83afc4623b719c3ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:16:28,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:16:28,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:16:28,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:16:28,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:16:28,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:16:28,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:16:28,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:16:28,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:16:28,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:16:28,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:16:28,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:16:28,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:16:28,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:16:28,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:16:28,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:16:28,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:16:28,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:16:28,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:16:28,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:16:28,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:16:28,536 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 -> 213a6773a680bcbd913164a5664bc5a26b44f83b15a409d83afc4623b719c3ae [2024-11-07 09:16:28,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:16:28,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:16:28,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:16:28,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:16:28,851 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:16:28,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i [2024-11-07 09:16:30,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:16:30,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:16:30,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-90.i [2024-11-07 09:16:30,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f876d9042/8d6b4232469249aba6fb41bbf3f34cd2/FLAG96c9f45f0 [2024-11-07 09:16:30,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f876d9042/8d6b4232469249aba6fb41bbf3f34cd2 [2024-11-07 09:16:30,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:16:30,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:16:30,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:16:30,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:16:30,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:16:30,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bee632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30, skipping insertion in model container [2024-11-07 09:16:30,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:16:30,846 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_operatoramount_amount10_file-90.i[915,928] [2024-11-07 09:16:30,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:16:30,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:16:30,886 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_operatoramount_amount10_file-90.i[915,928] [2024-11-07 09:16:30,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:16:30,911 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:16:30,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30 WrapperNode [2024-11-07 09:16:30,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:16:30,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:16:30,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:16:30,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:16:30,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,936 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-11-07 09:16:30,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:16:30,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:16:30,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:16:30,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:16:30,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,953 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 09:16:30,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:16:30,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:16:30,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:16:30,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:16:30,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (1/1) ... [2024-11-07 09:16:30,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:16:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:16:31,000 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 09:16:31,004 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 09:16:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:16:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:16:31,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:16:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:16:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:16:31,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:16:31,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:16:31,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:16:31,174 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 09:16:31,174 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:16:31,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:16:31,180 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:16:31,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:16:31 BoogieIcfgContainer [2024-11-07 09:16:31,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:16:31,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:16:31,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:16:31,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:16:31,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:16:30" (1/3) ... [2024-11-07 09:16:31,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c513dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:16:31, skipping insertion in model container [2024-11-07 09:16:31,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:16:30" (2/3) ... [2024-11-07 09:16:31,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c513dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:16:31, skipping insertion in model container [2024-11-07 09:16:31,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:16:31" (3/3) ... [2024-11-07 09:16:31,188 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-90.i [2024-11-07 09:16:31,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:16:31,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:16:31,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:16:31,238 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;@75a74d36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:16:31,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:16:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 09:16:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 09:16:31,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:31,246 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 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 09:16:31,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:31,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash -150909191, now seen corresponding path program 1 times [2024-11-07 09:16:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:16:31,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609674261] [2024-11-07 09:16:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:16:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:16:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:16:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:16:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:16:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:16:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:16:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:16:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:16:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 09:16:31,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:16:31,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609674261] [2024-11-07 09:16:31,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609674261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:31,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:16:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442065859] [2024-11-07 09:16:31,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:31,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:16:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:16:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:16:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:16:31,484 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 09:16:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:31,500 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2024-11-07 09:16:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:16:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-11-07 09:16:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:31,507 INFO L225 Difference]: With dead ends: 59 [2024-11-07 09:16:31,507 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 09:16:31,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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 09:16:31,512 INFO L432 NwaCegarLoop]: 38 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, 38 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 09:16:31,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:16:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 09:16:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 09:16:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 09:16:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-07 09:16:31,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 54 [2024-11-07 09:16:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:31,541 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-07 09:16:31,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 09:16:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-07 09:16:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 09:16:31,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:31,542 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 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 09:16:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:16:31,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash -956776711, now seen corresponding path program 1 times [2024-11-07 09:16:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:16:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780077050] [2024-11-07 09:16:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:16:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:16:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:16:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:16:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:16:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:16:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:16:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:16:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:16:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 09:16:32,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:16:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780077050] [2024-11-07 09:16:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780077050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:32,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:16:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948192231] [2024-11-07 09:16:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:16:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:16:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:16:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:16:32,188 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:32,363 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-07 09:16:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:16:32,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2024-11-07 09:16:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:32,364 INFO L225 Difference]: With dead ends: 63 [2024-11-07 09:16:32,364 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 09:16:32,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:16:32,365 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:32,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 163 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:16:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 09:16:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-11-07 09:16:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:16:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-07 09:16:32,381 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 54 [2024-11-07 09:16:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:32,382 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-07 09:16:32,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2024-11-07 09:16:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 09:16:32,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:32,383 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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 09:16:32,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:16:32,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:32,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 458194769, now seen corresponding path program 1 times [2024-11-07 09:16:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:16:32,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731370298] [2024-11-07 09:16:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:32,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:16:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:16:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:16:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:16:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:16:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:16:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:16:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:16:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:16:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 09:16:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:16:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731370298] [2024-11-07 09:16:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731370298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:16:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886004979] [2024-11-07 09:16:32,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:16:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:16:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:16:32,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:16:32,736 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:32,930 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2024-11-07 09:16:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:16:32,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-11-07 09:16:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:32,932 INFO L225 Difference]: With dead ends: 58 [2024-11-07 09:16:32,933 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 09:16:32,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:16:32,934 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:32,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:16:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 09:16:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-07 09:16:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:16:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-07 09:16:32,949 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 55 [2024-11-07 09:16:32,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:32,949 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-07 09:16:32,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2024-11-07 09:16:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 09:16:32,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:32,952 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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 09:16:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:16:32,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 460041811, now seen corresponding path program 1 times [2024-11-07 09:16:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:16:32,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416640783] [2024-11-07 09:16:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:16:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:16:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:16:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:16:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:16:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:16:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:16:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:16:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:16:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 09:16:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:16:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416640783] [2024-11-07 09:16:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416640783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 09:16:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323094012] [2024-11-07 09:16:33,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:33,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 09:16:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:16:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 09:16:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 09:16:33,203 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:33,306 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2024-11-07 09:16:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 09:16:33,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-11-07 09:16:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:33,307 INFO L225 Difference]: With dead ends: 85 [2024-11-07 09:16:33,307 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 09:16:33,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:16:33,308 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:33,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 112 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:16:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 09:16:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-07 09:16:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:16:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-07 09:16:33,322 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 55 [2024-11-07 09:16:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:33,323 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-07 09:16:33,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-07 09:16:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 09:16:33,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:33,327 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:16:33,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 09:16:33,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash 21912416, now seen corresponding path program 1 times [2024-11-07 09:16:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:16:33,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097530053] [2024-11-07 09:16:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:33,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:16:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:16:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:16:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:16:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:16:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:16:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:16:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:16:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:16:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:16:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:16:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:16:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:16:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 09:16:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 09:16:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 09:16:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 09:16:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-07 09:16:33,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:16:33,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097530053] [2024-11-07 09:16:33,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097530053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:33,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:33,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 09:16:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6290525] [2024-11-07 09:16:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 09:16:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:16:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 09:16:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 09:16:33,590 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:33,663 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-11-07 09:16:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 09:16:33,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 105 [2024-11-07 09:16:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:33,664 INFO L225 Difference]: With dead ends: 61 [2024-11-07 09:16:33,664 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 09:16:33,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:16:33,664 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:33,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:16:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 09:16:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2024-11-07 09:16:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 09:16:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-07 09:16:33,676 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 105 [2024-11-07 09:16:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:33,677 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-07 09:16:33,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-07 09:16:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 09:16:33,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:16:33,680 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 09:16:33,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 09:16:33,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:16:33,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:16:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 734633676, now seen corresponding path program 1 times [2024-11-07 09:16:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:16:33,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550862216] [2024-11-07 09:16:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:16:33,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:16:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:16:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:16:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:16:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:16:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:16:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:16:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:16:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:16:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 09:16:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:16:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 09:16:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 09:16:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 09:16:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 09:16:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 09:16:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 09:16:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:16:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2024-11-07 09:16:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:16:34,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550862216] [2024-11-07 09:16:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550862216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:16:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:16:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 09:16:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298745052] [2024-11-07 09:16:34,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:16:34,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 09:16:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:16:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 09:16:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 09:16:34,304 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:16:34,479 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-07 09:16:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 09:16:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 106 [2024-11-07 09:16:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:16:34,480 INFO L225 Difference]: With dead ends: 53 [2024-11-07 09:16:34,480 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 09:16:34,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 09:16:34,481 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:16:34,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:16:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 09:16:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 09:16:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 09:16:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 09:16:34,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2024-11-07 09:16:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:16:34,482 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 09:16:34,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 09:16:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 09:16:34,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 09:16:34,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:16:34,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 09:16:34,498 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 09:16:34,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 09:16:34,545 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:16:34,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:16:34 BoogieIcfgContainer [2024-11-07 09:16:34,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:16:34,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:16:34,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:16:34,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:16:34,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:16:31" (3/4) ... [2024-11-07 09:16:34,574 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 09:16:34,583 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 09:16:34,590 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 09:16:34,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 09:16:34,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 09:16:34,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 09:16:34,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 09:16:34,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 09:16:34,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:16:34,718 INFO L158 Benchmark]: Toolchain (without parser) took 3987.91ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 93.5MB in the beginning and 53.2MB in the end (delta: 40.2MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-11-07 09:16:34,718 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:34,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.48ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 82.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:16:34,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.34ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:34,723 INFO L158 Benchmark]: Boogie Preprocessor took 30.14ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:16:34,723 INFO L158 Benchmark]: RCFGBuilder took 211.44ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 68.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:16:34,723 INFO L158 Benchmark]: TraceAbstraction took 3389.09ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 68.0MB in the beginning and 57.5MB in the end (delta: 10.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-07 09:16:34,725 INFO L158 Benchmark]: Witness Printer took 145.37ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 53.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:16:34,727 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.48ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 82.1MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.34ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 80.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.14ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 211.44ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 68.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3389.09ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 68.0MB in the beginning and 57.5MB in the end (delta: 10.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 145.37ms. Allocated memory is still 142.6MB. Free memory was 57.5MB in the beginning and 53.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 789 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 206 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=2, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1444/1444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-07 09:16:34,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE