./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.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_fillercode_fillercodestructure_normal_file-4.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', '7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d'] 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_fillercode_fillercodestructure_normal_file-4.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:25:56,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:25:56,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:25:56,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:25:56,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:25:56,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:25:56,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:25:56,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:25:56,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:25:56,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:25:56,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:25:56,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:25:56,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:25:56,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:25:56,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:25:56,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:25:56,986 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-11-07 07:25:57,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:25:57,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:25:57,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:25:57,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:25:57,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:25:57,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-11-07 07:25:58,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:25:58,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:25:58,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-11-07 07:25:58,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1e3f22bf/6690fd1d76a44d9aa35e3c3adf40c13d/FLAG72635e7f1 [2024-11-07 07:25:59,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1e3f22bf/6690fd1d76a44d9aa35e3c3adf40c13d [2024-11-07 07:25:59,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:25:59,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:25:59,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:25:59,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:25:59,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:25:59,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5239a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59, skipping insertion in model container [2024-11-07 07:25:59,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:25:59,439 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_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-11-07 07:25:59,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:25:59,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:25:59,531 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_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-11-07 07:25:59,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:25:59,594 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:25:59,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59 WrapperNode [2024-11-07 07:25:59,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:25:59,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:25:59,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:25:59,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:25:59,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,653 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-07 07:25:59,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:25:59,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:25:59,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:25:59,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:25:59,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,694 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 07:25:59,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:25:59,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:25:59,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:25:59,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:25:59,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (1/1) ... [2024-11-07 07:25:59,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:25:59,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:25:59,774 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 07:25:59,777 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 07:25:59,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:25:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:25:59,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:25:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:25:59,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:25:59,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:25:59,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:25:59,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:26:00,110 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 07:26:00,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:26:00,116 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:26:00,117 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:26:00,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:26:00 BoogieIcfgContainer [2024-11-07 07:26:00,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:26:00,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:26:00,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:26:00,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:26:00,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:25:59" (1/3) ... [2024-11-07 07:26:00,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289a82c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:26:00, skipping insertion in model container [2024-11-07 07:26:00,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:25:59" (2/3) ... [2024-11-07 07:26:00,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289a82c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:26:00, skipping insertion in model container [2024-11-07 07:26:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:26:00" (3/3) ... [2024-11-07 07:26:00,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-4.i [2024-11-07 07:26:00,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:26:00,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:26:00,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:26:00,209 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;@337bbe23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:26:00,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:26:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:26:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 07:26:00,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:00,226 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:00,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:00,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash -246695732, now seen corresponding path program 1 times [2024-11-07 07:26:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195860660] [2024-11-07 07:26:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:00,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195860660] [2024-11-07 07:26:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195860660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:26:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911046724] [2024-11-07 07:26:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:00,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:26:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:26:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:26:00,532 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 07:26:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:00,551 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-07 07:26:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:26:00,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-07 07:26:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:00,557 INFO L225 Difference]: With dead ends: 121 [2024-11-07 07:26:00,557 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 07:26:00,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 07:26:00,562 INFO L432 NwaCegarLoop]: 89 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, 89 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 07:26:00,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:26:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 07:26:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 07:26:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:26:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-07 07:26:00,603 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-07 07:26:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:00,604 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-07 07:26:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 07:26:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-07 07:26:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 07:26:00,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:00,610 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:00,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:26:00,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:00,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -157864659, now seen corresponding path program 1 times [2024-11-07 07:26:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276170082] [2024-11-07 07:26:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276170082] [2024-11-07 07:26:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276170082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:01,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:01,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:26:01,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696320623] [2024-11-07 07:26:01,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:26:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:01,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:26:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:26:01,393 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:01,469 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2024-11-07 07:26:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:26:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 07:26:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:01,474 INFO L225 Difference]: With dead ends: 174 [2024-11-07 07:26:01,474 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 07:26:01,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:26:01,475 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:01,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 171 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:26:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 07:26:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-07 07:26:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:26:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2024-11-07 07:26:01,520 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 130 [2024-11-07 07:26:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:01,521 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2024-11-07 07:26:01,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2024-11-07 07:26:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 07:26:01,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:01,524 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:26:01,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:01,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash -416030097, now seen corresponding path program 1 times [2024-11-07 07:26:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:01,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941329025] [2024-11-07 07:26:01,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941329025] [2024-11-07 07:26:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941329025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:26:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558217670] [2024-11-07 07:26:02,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:02,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:26:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:26:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:26:02,248 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:02,550 INFO L93 Difference]: Finished difference Result 367 states and 546 transitions. [2024-11-07 07:26:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:26:02,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 07:26:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:02,553 INFO L225 Difference]: With dead ends: 367 [2024-11-07 07:26:02,553 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 07:26:02,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:26:02,558 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 118 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:02,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 436 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:26:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 07:26:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 228. [2024-11-07 07:26:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 143 states have internal predecessors, (182), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-07 07:26:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 342 transitions. [2024-11-07 07:26:02,615 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 342 transitions. Word has length 130 [2024-11-07 07:26:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:02,616 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 342 transitions. [2024-11-07 07:26:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 342 transitions. [2024-11-07 07:26:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 07:26:02,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:02,621 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:02,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:26:02,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash -414183055, now seen corresponding path program 1 times [2024-11-07 07:26:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745658470] [2024-11-07 07:26:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745658470] [2024-11-07 07:26:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745658470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:08,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:08,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 07:26:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448143714] [2024-11-07 07:26:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:08,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:26:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:08,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:26:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:26:08,068 INFO L87 Difference]: Start difference. First operand 228 states and 342 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:10,947 INFO L93 Difference]: Finished difference Result 624 states and 914 transitions. [2024-11-07 07:26:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 07:26:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 07:26:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:10,950 INFO L225 Difference]: With dead ends: 624 [2024-11-07 07:26:10,950 INFO L226 Difference]: Without dead ends: 399 [2024-11-07 07:26:10,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:26:10,955 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 169 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:10,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 542 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 07:26:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-07 07:26:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 300. [2024-11-07 07:26:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 193 states have (on average 1.2590673575129534) internal successors, (243), 193 states have internal predecessors, (243), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-07 07:26:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 443 transitions. [2024-11-07 07:26:11,012 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 443 transitions. Word has length 130 [2024-11-07 07:26:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:11,014 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 443 transitions. [2024-11-07 07:26:11,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2024-11-07 07:26:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:11,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:11,015 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:11,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:26:11,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:11,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1321620594, now seen corresponding path program 1 times [2024-11-07 07:26:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204921219] [2024-11-07 07:26:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204921219] [2024-11-07 07:26:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204921219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:11,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:26:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796495526] [2024-11-07 07:26:11,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:26:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:26:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:26:11,233 INFO L87 Difference]: Start difference. First operand 300 states and 443 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:11,416 INFO L93 Difference]: Finished difference Result 527 states and 785 transitions. [2024-11-07 07:26:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:26:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-07 07:26:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:11,423 INFO L225 Difference]: With dead ends: 527 [2024-11-07 07:26:11,423 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 07:26:11,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 07:26:11,426 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:11,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 247 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:26:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 07:26:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 300. [2024-11-07 07:26:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 193 states have (on average 1.2590673575129534) internal successors, (243), 193 states have internal predecessors, (243), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-07 07:26:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 443 transitions. [2024-11-07 07:26:11,483 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 443 transitions. Word has length 131 [2024-11-07 07:26:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:11,484 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 443 transitions. [2024-11-07 07:26:11,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2024-11-07 07:26:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:11,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:11,487 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:11,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:26:11,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1063455156, now seen corresponding path program 1 times [2024-11-07 07:26:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860008753] [2024-11-07 07:26:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:26:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860008753] [2024-11-07 07:26:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860008753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:26:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756384201] [2024-11-07 07:26:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:11,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:26:11,747 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 07:26:11,753 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 07:26:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:11,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:26:11,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-07 07:26:12,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:26:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:26:12,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756384201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:26:12,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:26:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 07:26:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579654588] [2024-11-07 07:26:12,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:26:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:26:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:12,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:26:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:26:12,321 INFO L87 Difference]: Start difference. First operand 300 states and 443 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-07 07:26:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:12,448 INFO L93 Difference]: Finished difference Result 559 states and 803 transitions. [2024-11-07 07:26:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:26:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 131 [2024-11-07 07:26:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:12,451 INFO L225 Difference]: With dead ends: 559 [2024-11-07 07:26:12,451 INFO L226 Difference]: Without dead ends: 329 [2024-11-07 07:26:12,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:26:12,452 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:12,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 130 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:26:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-07 07:26:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2024-11-07 07:26:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 181 states have (on average 1.132596685082873) internal successors, (205), 181 states have internal predecessors, (205), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-07 07:26:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2024-11-07 07:26:12,505 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 131 [2024-11-07 07:26:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:12,505 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2024-11-07 07:26:12,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-07 07:26:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2024-11-07 07:26:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:12,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:12,507 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:12,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 07:26:12,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:12,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:12,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:12,708 INFO L85 PathProgramCache]: Analyzing trace with hash 695481101, now seen corresponding path program 1 times [2024-11-07 07:26:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485221739] [2024-11-07 07:26:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:12,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485221739] [2024-11-07 07:26:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485221739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:26:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93003151] [2024-11-07 07:26:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:26:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:26:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:26:12,934 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:13,087 INFO L93 Difference]: Finished difference Result 430 states and 594 transitions. [2024-11-07 07:26:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:26:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-07 07:26:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:13,089 INFO L225 Difference]: With dead ends: 430 [2024-11-07 07:26:13,089 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 07:26:13,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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 07:26:13,090 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 45 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:13,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 257 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:26:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 07:26:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2024-11-07 07:26:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 110 states have internal predecessors, (124), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 07:26:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 244 transitions. [2024-11-07 07:26:13,106 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 244 transitions. Word has length 131 [2024-11-07 07:26:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 244 transitions. [2024-11-07 07:26:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 244 transitions. [2024-11-07 07:26:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:13,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:13,107 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:13,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:26:13,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1282287115, now seen corresponding path program 1 times [2024-11-07 07:26:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097988584] [2024-11-07 07:26:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:26:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097988584] [2024-11-07 07:26:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097988584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:26:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981839217] [2024-11-07 07:26:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:26:13,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:26:13,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 07:26:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:13,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 07:26:13,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-07 07:26:13,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:26:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:26:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981839217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:26:13,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:26:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-07 07:26:13,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021978649] [2024-11-07 07:26:13,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:26:13,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:26:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:26:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:26:13,784 INFO L87 Difference]: Start difference. First operand 178 states and 244 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 07:26:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:14,108 INFO L93 Difference]: Finished difference Result 327 states and 438 transitions. [2024-11-07 07:26:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:26:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 131 [2024-11-07 07:26:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:14,110 INFO L225 Difference]: With dead ends: 327 [2024-11-07 07:26:14,110 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 07:26:14,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-07 07:26:14,111 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:14,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 383 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:26:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 07:26:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 184. [2024-11-07 07:26:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 114 states have internal predecessors, (127), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 07:26:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2024-11-07 07:26:14,143 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 131 [2024-11-07 07:26:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:14,144 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2024-11-07 07:26:14,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 07:26:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2024-11-07 07:26:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:14,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:14,147 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:14,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:26:14,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:14,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:14,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1284134157, now seen corresponding path program 1 times [2024-11-07 07:26:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:14,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436210017] [2024-11-07 07:26:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:14,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:14,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436210017] [2024-11-07 07:26:14,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436210017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:14,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:14,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:26:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274193364] [2024-11-07 07:26:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:14,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:26:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:14,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:26:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:26:14,466 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:14,506 INFO L93 Difference]: Finished difference Result 374 states and 504 transitions. [2024-11-07 07:26:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:26:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-07 07:26:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:14,508 INFO L225 Difference]: With dead ends: 374 [2024-11-07 07:26:14,508 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 07:26:14,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:26:14,512 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:14,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:26:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 07:26:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2024-11-07 07:26:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 152 states have (on average 1.118421052631579) internal successors, (170), 152 states have internal predecessors, (170), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-07 07:26:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 330 transitions. [2024-11-07 07:26:14,530 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 330 transitions. Word has length 131 [2024-11-07 07:26:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:14,530 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 330 transitions. [2024-11-07 07:26:14,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 330 transitions. [2024-11-07 07:26:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:14,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:14,531 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:14,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:26:14,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:14,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1191285994, now seen corresponding path program 1 times [2024-11-07 07:26:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245443435] [2024-11-07 07:26:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:14,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245443435] [2024-11-07 07:26:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245443435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:14,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:26:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945573925] [2024-11-07 07:26:14,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:26:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:26:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:26:14,629 INFO L87 Difference]: Start difference. First operand 245 states and 330 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:14,737 INFO L93 Difference]: Finished difference Result 549 states and 742 transitions. [2024-11-07 07:26:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:26:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-07 07:26:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:14,739 INFO L225 Difference]: With dead ends: 549 [2024-11-07 07:26:14,739 INFO L226 Difference]: Without dead ends: 365 [2024-11-07 07:26:14,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 07:26:14,740 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 84 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:14,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 297 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:26:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-07 07:26:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2024-11-07 07:26:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 222 states have (on average 1.1081081081081081) internal successors, (246), 222 states have internal predecessors, (246), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-07 07:26:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 486 transitions. [2024-11-07 07:26:14,768 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 486 transitions. Word has length 131 [2024-11-07 07:26:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:14,769 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 486 transitions. [2024-11-07 07:26:14,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 486 transitions. [2024-11-07 07:26:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:14,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:14,769 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:14,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:26:14,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:14,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1871344364, now seen corresponding path program 1 times [2024-11-07 07:26:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:14,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782106900] [2024-11-07 07:26:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:26:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:26:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:26:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:26:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:26:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:26:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:26:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 07:26:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:26:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 07:26:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 07:26:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 07:26:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 07:26:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 07:26:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 07:26:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:26:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 07:26:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:26:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:26:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 07:26:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:26:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:26:15,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782106900] [2024-11-07 07:26:15,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782106900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:26:15,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555847909] [2024-11-07 07:26:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:15,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:15,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:26:15,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:26:15,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 07:26:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:15,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 07:26:15,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 471 proven. 126 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-07 07:26:17,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:26:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555847909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:26:42,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:26:42,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2024-11-07 07:26:42,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566500033] [2024-11-07 07:26:42,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:26:42,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 07:26:42,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:26:42,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 07:26:42,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1158, Unknown=3, NotChecked=0, Total=1560 [2024-11-07 07:26:42,646 INFO L87 Difference]: Start difference. First operand 361 states and 486 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-07 07:26:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:45,574 INFO L93 Difference]: Finished difference Result 532 states and 677 transitions. [2024-11-07 07:26:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-07 07:26:45,575 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 131 [2024-11-07 07:26:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:45,577 INFO L225 Difference]: With dead ends: 532 [2024-11-07 07:26:45,577 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 07:26:45,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=2046, Invalid=6323, Unknown=3, NotChecked=0, Total=8372 [2024-11-07 07:26:45,581 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 384 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:45,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 454 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 07:26:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 07:26:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2024-11-07 07:26:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.0390625) internal successors, (133), 129 states have internal predecessors, (133), 48 states have call successors, (48), 20 states have call predecessors, (48), 20 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:26:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2024-11-07 07:26:45,608 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 131 [2024-11-07 07:26:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:45,608 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2024-11-07 07:26:45,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-07 07:26:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2024-11-07 07:26:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 07:26:45,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:45,611 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:45,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 07:26:45,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:45,815 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:45,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1995455282, now seen corresponding path program 1 times [2024-11-07 07:26:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:26:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384536852] [2024-11-07 07:26:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:26:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:26:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098578545] [2024-11-07 07:26:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:26:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:26:45,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:26:45,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 07:26:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:26:46,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:26:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:26:46,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:26:46,586 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:26:46,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:26:46,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 07:26:46,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 07:26:46,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:26:46,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:26:46,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:26:46 BoogieIcfgContainer [2024-11-07 07:26:46,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:26:46,915 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:26:46,915 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:26:46,915 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:26:46,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:26:00" (3/4) ... [2024-11-07 07:26:46,918 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:26:46,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:26:46,920 INFO L158 Benchmark]: Toolchain (without parser) took 47672.44ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 92.5MB in the beginning and 341.6MB in the end (delta: -249.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-07 07:26:46,920 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:26:46,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.55ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:26:46,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.15ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:26:46,921 INFO L158 Benchmark]: Boogie Preprocessor took 67.62ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 72.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:26:46,922 INFO L158 Benchmark]: RCFGBuilder took 391.21ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 52.8MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 07:26:46,922 INFO L158 Benchmark]: TraceAbstraction took 46792.07ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 52.1MB in the beginning and 341.7MB in the end (delta: -289.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:26:46,922 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 402.7MB. Free memory was 341.7MB in the beginning and 341.6MB in the end (delta: 101.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:26:46,923 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.28ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.55ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.5MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.15ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.62ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 72.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 391.21ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 52.8MB in the end (delta: 19.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 46792.07ms. Allocated memory was 117.4MB in the beginning and 402.7MB in the end (delta: 285.2MB). Free memory was 52.1MB in the beginning and 341.7MB in the end (delta: -289.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 402.7MB. Free memory was 341.7MB in the beginning and 341.6MB in the end (delta: 101.4kB). 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET updateVariables() [L140] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=-1073741842, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=-1073741842, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.6s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1191 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 3172 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2112 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2303 IncrementalHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 1060 mSDtfsCounter, 2303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1364 GetRequests, 1207 SyntacticMatches, 4 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 26.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=10, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 353 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 2093 NumberOfCodeBlocks, 2093 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2075 ConstructedInterpolants, 0 QuantifiedInterpolants, 10917 SizeOfPredicates, 12 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 11695/12160 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:26:47,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:26:49,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:26:49,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:26:49,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:26:49,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:26:49,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:26:49,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:26:49,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:26:49,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:26:49,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:26:49,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:26:49,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:26:49,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:26:49,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:26:49,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:26:49,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:26:49,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:26:49,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:26:49,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:26:49,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:26:49,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:26:49,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:26:49,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:26:49,216 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:26:49,217 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:26:49,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:26:49,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:26:49,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:26:49,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:26:49,217 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-11-07 07:26:49,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:26:49,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:26:49,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:26:49,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:26:49,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:26:49,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-11-07 07:26:50,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:26:51,012 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:26:51,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-11-07 07:26:51,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d253b5fc/4dacad3be54d4781b392436f8af7b098/FLAGdb7cd053d [2024-11-07 07:26:51,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d253b5fc/4dacad3be54d4781b392436f8af7b098 [2024-11-07 07:26:51,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:26:51,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:26:51,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:26:51,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:26:51,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:26:51,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa166b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51, skipping insertion in model container [2024-11-07 07:26:51,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:26:51,165 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_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-11-07 07:26:51,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:26:51,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:26:51,245 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_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-11-07 07:26:51,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:26:51,293 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:26:51,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51 WrapperNode [2024-11-07 07:26:51,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:26:51,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:26:51,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:26:51,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:26:51,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,341 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-07 07:26:51,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:26:51,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:26:51,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:26:51,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:26:51,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,368 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 07:26:51,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:26:51,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:26:51,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:26:51,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:26:51,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (1/1) ... [2024-11-07 07:26:51,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:26:51,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:26:51,444 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 07:26:51,448 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 07:26:51,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:26:51,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:26:51,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:26:51,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:26:51,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:26:51,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:26:51,536 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:26:51,538 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:26:52,004 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 07:26:52,005 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:26:52,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:26:52,015 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:26:52,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:26:52 BoogieIcfgContainer [2024-11-07 07:26:52,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:26:52,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:26:52,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:26:52,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:26:52,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:26:51" (1/3) ... [2024-11-07 07:26:52,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63addf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:26:52, skipping insertion in model container [2024-11-07 07:26:52,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:26:51" (2/3) ... [2024-11-07 07:26:52,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63addf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:26:52, skipping insertion in model container [2024-11-07 07:26:52,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:26:52" (3/3) ... [2024-11-07 07:26:52,026 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-4.i [2024-11-07 07:26:52,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:26:52,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:26:52,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:26:52,129 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;@459c325c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:26:52,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:26:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:26:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 07:26:52,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:52,140 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:52,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -246695732, now seen corresponding path program 1 times [2024-11-07 07:26:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:26:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365067693] [2024-11-07 07:26:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:52,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:52,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:26:52,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:26:52,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:26:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:52,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:26:52,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-07 07:26:52,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:26:52,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:26:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365067693] [2024-11-07 07:26:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365067693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:26:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399721374] [2024-11-07 07:26:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:52,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:26:52,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:26:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:26:52,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:26:52,396 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 07:26:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:52,411 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-07 07:26:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:26:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-07 07:26:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:52,416 INFO L225 Difference]: With dead ends: 121 [2024-11-07 07:26:52,417 INFO L226 Difference]: Without dead ends: 60 [2024-11-07 07:26:52,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 07:26:52,420 INFO L432 NwaCegarLoop]: 89 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, 89 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 07:26:52,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:26:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-07 07:26:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-07 07:26:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:26:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-07 07:26:52,452 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-07 07:26:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:52,452 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-07 07:26:52,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 07:26:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-07 07:26:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 07:26:52,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:52,456 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:52,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:26:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:52,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:52,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash -157864659, now seen corresponding path program 1 times [2024-11-07 07:26:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:26:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820679386] [2024-11-07 07:26:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:52,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:26:52,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:26:52,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:26:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:52,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:26:52,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:26:53,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:26:53,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:26:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820679386] [2024-11-07 07:26:53,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820679386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:26:53,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:26:53,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:26:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187714785] [2024-11-07 07:26:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:26:53,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:26:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:26:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:26:53,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:26:53,596 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:54,478 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2024-11-07 07:26:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:26:54,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-07 07:26:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:54,495 INFO L225 Difference]: With dead ends: 175 [2024-11-07 07:26:54,495 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 07:26:54,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:26:54,496 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 51 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:54,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 272 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 07:26:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 07:26:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-07 07:26:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:26:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2024-11-07 07:26:54,521 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 130 [2024-11-07 07:26:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:54,522 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2024-11-07 07:26:54,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:26:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2024-11-07 07:26:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 07:26:54,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:54,524 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:54,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:26:54,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:54,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:54,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash -416030097, now seen corresponding path program 1 times [2024-11-07 07:26:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:26:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910016900] [2024-11-07 07:26:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:26:54,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:26:54,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:26:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:54,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 07:26:54,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-07 07:26:55,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:26:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-07 07:26:56,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:26:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910016900] [2024-11-07 07:26:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910016900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:26:56,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:26:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-07 07:26:56,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384227454] [2024-11-07 07:26:56,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:26:56,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 07:26:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:26:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 07:26:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:26:56,077 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-07 07:26:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:57,638 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2024-11-07 07:26:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 07:26:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 130 [2024-11-07 07:26:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:57,641 INFO L225 Difference]: With dead ends: 200 [2024-11-07 07:26:57,642 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 07:26:57,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-07 07:26:57,643 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:57,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 237 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 07:26:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 07:26:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2024-11-07 07:26:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:26:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2024-11-07 07:26:57,657 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 130 [2024-11-07 07:26:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:57,657 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2024-11-07 07:26:57,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-07 07:26:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2024-11-07 07:26:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:57,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:57,659 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:57,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 07:26:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:57,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:26:57,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:26:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1983351693, now seen corresponding path program 1 times [2024-11-07 07:26:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:26:57,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281482336] [2024-11-07 07:26:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:26:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:26:57,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:26:57,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:26:57,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 07:26:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:26:58,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:26:58,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:26:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-07 07:26:58,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:26:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:26:58,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:26:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281482336] [2024-11-07 07:26:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281482336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:26:58,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:26:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-07 07:26:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774037341] [2024-11-07 07:26:58,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:26:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:26:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:26:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:26:58,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:26:58,612 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 07:26:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:26:59,934 INFO L93 Difference]: Finished difference Result 265 states and 349 transitions. [2024-11-07 07:26:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:26:59,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 131 [2024-11-07 07:26:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:26:59,937 INFO L225 Difference]: With dead ends: 265 [2024-11-07 07:26:59,938 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 07:26:59,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-07 07:26:59,939 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 100 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:26:59,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 350 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 07:26:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 07:26:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2024-11-07 07:26:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.0943396226415094) internal successors, (116), 106 states have internal predecessors, (116), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 07:26:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2024-11-07 07:26:59,983 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 131 [2024-11-07 07:26:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:26:59,984 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2024-11-07 07:26:59,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-07 07:26:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2024-11-07 07:26:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:26:59,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:26:59,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:00,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 07:27:00,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:00,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:00,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1985198735, now seen corresponding path program 1 times [2024-11-07 07:27:00,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:27:00,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519480368] [2024-11-07 07:27:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:27:00,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:27:00,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 07:27:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:00,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:27:00,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:27:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-07 07:27:00,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:27:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 07:27:01,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:27:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519480368] [2024-11-07 07:27:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519480368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:27:01,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:27:01,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-11-07 07:27:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831599957] [2024-11-07 07:27:01,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:27:01,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:27:01,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:27:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:27:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:27:01,067 INFO L87 Difference]: Start difference. First operand 176 states and 236 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:27:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:01,816 INFO L93 Difference]: Finished difference Result 268 states and 351 transitions. [2024-11-07 07:27:01,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 07:27:01,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 131 [2024-11-07 07:27:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:01,828 INFO L225 Difference]: With dead ends: 268 [2024-11-07 07:27:01,829 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 07:27:01,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:27:01,831 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 65 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:01,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 193 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 07:27:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 07:27:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2024-11-07 07:27:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:27:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-11-07 07:27:01,871 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 131 [2024-11-07 07:27:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:01,871 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-11-07 07:27:01,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:27:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-11-07 07:27:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:27:01,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:01,877 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:01,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 07:27:02,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:02,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1191285994, now seen corresponding path program 1 times [2024-11-07 07:27:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:27:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897017354] [2024-11-07 07:27:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:27:02,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:27:02,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 07:27:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:02,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 07:27:02,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:27:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 07:27:02,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:27:02,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:27:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897017354] [2024-11-07 07:27:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897017354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:27:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:27:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:27:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739059429] [2024-11-07 07:27:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:27:02,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:27:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:27:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:27:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:27:02,470 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:27:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:03,051 INFO L93 Difference]: Finished difference Result 239 states and 318 transitions. [2024-11-07 07:27:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:27:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-07 07:27:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:03,054 INFO L225 Difference]: With dead ends: 239 [2024-11-07 07:27:03,055 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 07:27:03,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:27:03,061 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 90 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:03,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 204 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:27:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 07:27:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-11-07 07:27:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 104 states have (on average 1.0673076923076923) internal successors, (111), 104 states have internal predecessors, (111), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 07:27:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2024-11-07 07:27:03,101 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 131 [2024-11-07 07:27:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2024-11-07 07:27:03,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 07:27:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2024-11-07 07:27:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:27:03,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:03,106 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:03,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 07:27:03,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:03,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1871344364, now seen corresponding path program 1 times [2024-11-07 07:27:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:27:03,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644707560] [2024-11-07 07:27:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:03,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:03,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:27:03,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:27:03,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 07:27:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:03,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 07:27:03,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:27:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-07 07:27:04,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:27:04,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:27:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644707560] [2024-11-07 07:27:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644707560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:27:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1249419720] [2024-11-07 07:27:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 07:27:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 07:27:04,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 07:27:04,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-07 07:27:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:04,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 07:27:04,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:27:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-07 07:27:05,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:27:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1249419720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:27:05,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:27:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-07 07:27:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584267975] [2024-11-07 07:27:05,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:27:05,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 07:27:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:27:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 07:27:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-07 07:27:05,762 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-11-07 07:27:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:27:08,550 INFO L93 Difference]: Finished difference Result 265 states and 339 transitions. [2024-11-07 07:27:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 07:27:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 131 [2024-11-07 07:27:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:27:08,553 INFO L225 Difference]: With dead ends: 265 [2024-11-07 07:27:08,553 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 07:27:08,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 07:27:08,554 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 234 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:27:08,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 355 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 07:27:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 07:27:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2024-11-07 07:27:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:27:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2024-11-07 07:27:08,597 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 131 [2024-11-07 07:27:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:27:08,597 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2024-11-07 07:27:08,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-11-07 07:27:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2024-11-07 07:27:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 07:27:08,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:27:08,598 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:08,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 07:27:08,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-07 07:27:09,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 07:27:09,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:27:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:27:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1995455282, now seen corresponding path program 1 times [2024-11-07 07:27:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:27:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467508727] [2024-11-07 07:27:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:27:09,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:27:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:27:09,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:27:09,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 07:27:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:27:09,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 07:27:09,163 INFO L278 TraceCheckSpWp]: Computing forward predicates...