./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.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', 'e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.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 e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:44:22,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:44:22,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:44:22,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:44:22,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:44:22,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:44:22,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:44:22,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:44:22,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:44:22,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:44:22,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:44:22,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:44:22,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:44:22,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:44:22,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:44:22,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:44:22,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:44:22,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:44:22,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:44:22,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:44:22,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:44:22,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:44:22,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:44:22,227 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 -> e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a [2024-11-07 10:44:22,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:44:22,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:44:22,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:44:22,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:44:22,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:44:22,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2024-11-07 10:44:24,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:44:24,298 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:44:24,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2024-11-07 10:44:24,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/888f58bad/af4b86be6a074e3493cdc18074ae8917/FLAG79500670f [2024-11-07 10:44:24,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/888f58bad/af4b86be6a074e3493cdc18074ae8917 [2024-11-07 10:44:24,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:44:24,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:44:24,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:44:24,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:44:24,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:44:24,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3add927f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24, skipping insertion in model container [2024-11-07 10:44:24,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:44:24,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i[916,929] [2024-11-07 10:44:24,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:44:24,590 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:44:24,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i[916,929] [2024-11-07 10:44:24,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:44:24,668 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:44:24,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24 WrapperNode [2024-11-07 10:44:24,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:44:24,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:44:24,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:44:24,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:44:24,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,756 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-11-07 10:44:24,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:44:24,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:44:24,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:44:24,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:44:24,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,781 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:44:24,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:44:24,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:44:24,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:44:24,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:44:24,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (1/1) ... [2024-11-07 10:44:24,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:44:24,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:24,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:44:24,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:44:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:44:24,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:44:24,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:44:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:44:24,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:44:24,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:44:25,032 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:44:25,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:44:25,700 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-07 10:44:25,701 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:44:25,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:44:25,714 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:44:25,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:25 BoogieIcfgContainer [2024-11-07 10:44:25,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:44:25,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:44:25,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:44:25,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:44:25,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:44:24" (1/3) ... [2024-11-07 10:44:25,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471e4bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:25, skipping insertion in model container [2024-11-07 10:44:25,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:24" (2/3) ... [2024-11-07 10:44:25,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471e4bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:25, skipping insertion in model container [2024-11-07 10:44:25,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:25" (3/3) ... [2024-11-07 10:44:25,726 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-37.i [2024-11-07 10:44:25,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:44:25,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:44:25,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:44:25,810 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;@6bdcb926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:44:25,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:44:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:44:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:44:25,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:25,825 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:25,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:25,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1984577287, now seen corresponding path program 1 times [2024-11-07 10:44:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965339064] [2024-11-07 10:44:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965339064] [2024-11-07 10:44:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965339064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:26,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:44:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394436418] [2024-11-07 10:44:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:44:26,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:26,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:44:26,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:44:26,267 INFO L87 Difference]: Start difference. First operand has 105 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:26,334 INFO L93 Difference]: Finished difference Result 203 states and 317 transitions. [2024-11-07 10:44:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:44:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-07 10:44:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:26,346 INFO L225 Difference]: With dead ends: 203 [2024-11-07 10:44:26,346 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:44:26,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:44:26,354 INFO L432 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:26,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:44:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:44:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-07 10:44:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:44:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-07 10:44:26,409 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2024-11-07 10:44:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-07 10:44:26,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-07 10:44:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:44:26,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:26,417 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:26,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:44:26,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:26,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1790675531, now seen corresponding path program 1 times [2024-11-07 10:44:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455371317] [2024-11-07 10:44:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455371317] [2024-11-07 10:44:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455371317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:44:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259163497] [2024-11-07 10:44:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:44:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:44:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:26,955 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:27,021 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions. [2024-11-07 10:44:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:44:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:44:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:27,023 INFO L225 Difference]: With dead ends: 202 [2024-11-07 10:44:27,023 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 10:44:27,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:27,025 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:27,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 421 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:44:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 10:44:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-07 10:44:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:44:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-11-07 10:44:27,044 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2024-11-07 10:44:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-11-07 10:44:27,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:27,049 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-11-07 10:44:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:44:27,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:27,053 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:27,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:44:27,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1824233395, now seen corresponding path program 1 times [2024-11-07 10:44:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:27,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921788785] [2024-11-07 10:44:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:27,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:27,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921788785] [2024-11-07 10:44:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921788785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:27,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:27,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:44:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496087180] [2024-11-07 10:44:27,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:27,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:44:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:44:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:27,381 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:27,419 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2024-11-07 10:44:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:44:27,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-07 10:44:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:27,424 INFO L225 Difference]: With dead ends: 206 [2024-11-07 10:44:27,424 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:44:27,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:27,426 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:27,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:44:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:44:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-07 10:44:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:44:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-11-07 10:44:27,437 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2024-11-07 10:44:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:27,437 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-11-07 10:44:27,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-11-07 10:44:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:44:27,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:27,439 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:27,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:44:27,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:27,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash -49226033, now seen corresponding path program 1 times [2024-11-07 10:44:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:27,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98571485] [2024-11-07 10:44:27,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:27,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98571485] [2024-11-07 10:44:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98571485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912460828] [2024-11-07 10:44:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:29,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:29,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:29,639 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:30,034 INFO L93 Difference]: Finished difference Result 221 states and 316 transitions. [2024-11-07 10:44:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:44:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-07 10:44:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:30,038 INFO L225 Difference]: With dead ends: 221 [2024-11-07 10:44:30,038 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:44:30,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:44:30,039 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 78 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:30,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 488 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:44:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:44:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-07 10:44:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 97 states have internal predecessors, (128), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:44:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-07 10:44:30,061 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 124 [2024-11-07 10:44:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:30,062 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-07 10:44:30,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-07 10:44:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:44:30,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:30,066 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:44:30,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:30,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash -388184328, now seen corresponding path program 1 times [2024-11-07 10:44:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647543986] [2024-11-07 10:44:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:31,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647543986] [2024-11-07 10:44:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647543986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:31,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:31,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596830033] [2024-11-07 10:44:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:31,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:31,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:31,211 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:31,626 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2024-11-07 10:44:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-07 10:44:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:31,629 INFO L225 Difference]: With dead ends: 330 [2024-11-07 10:44:31,630 INFO L226 Difference]: Without dead ends: 224 [2024-11-07 10:44:31,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:31,634 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 120 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:31,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 300 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:44:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-07 10:44:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2024-11-07 10:44:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 183 states have internal predecessors, (244), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:44:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 312 transitions. [2024-11-07 10:44:31,667 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 312 transitions. Word has length 127 [2024-11-07 10:44:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:31,667 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 312 transitions. [2024-11-07 10:44:31,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 312 transitions. [2024-11-07 10:44:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:44:31,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:31,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:31,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:44:31,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:31,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1399301578, now seen corresponding path program 1 times [2024-11-07 10:44:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:31,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849722517] [2024-11-07 10:44:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:32,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:32,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849722517] [2024-11-07 10:44:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849722517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371022516] [2024-11-07 10:44:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:32,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:32,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:32,533 INFO L87 Difference]: Start difference. First operand 220 states and 312 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:32,982 INFO L93 Difference]: Finished difference Result 431 states and 610 transitions. [2024-11-07 10:44:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-07 10:44:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:32,985 INFO L225 Difference]: With dead ends: 431 [2024-11-07 10:44:32,985 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 10:44:32,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:32,988 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 119 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:32,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 301 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:44:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 10:44:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-07 10:44:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3444444444444446) internal successors, (242), 182 states have internal predecessors, (242), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:44:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 310 transitions. [2024-11-07 10:44:33,016 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 310 transitions. Word has length 127 [2024-11-07 10:44:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:33,017 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 310 transitions. [2024-11-07 10:44:33,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 310 transitions. [2024-11-07 10:44:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:44:33,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:33,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:33,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:44:33,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:33,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash 891679350, now seen corresponding path program 1 times [2024-11-07 10:44:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724677652] [2024-11-07 10:44:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 10:44:34,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724677652] [2024-11-07 10:44:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724677652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:44:34,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468448716] [2024-11-07 10:44:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:34,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:44:34,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:34,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:44:34,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:44:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:34,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:44:34,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:44:34,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 10:44:34,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 10:44:34,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 10:44:34,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 10:44:34,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2024-11-07 10:44:34,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 92 [2024-11-07 10:44:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 64 [2024-11-07 10:44:34,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:34,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 15 [2024-11-07 10:44:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 218 proven. 24 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-07 10:44:34,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:44:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 10:44:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468448716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:44:35,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:44:35,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2024-11-07 10:44:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841247245] [2024-11-07 10:44:35,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:44:35,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:44:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:35,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:44:35,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:44:35,338 INFO L87 Difference]: Start difference. First operand 219 states and 310 transitions. Second operand has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-07 10:44:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:36,626 INFO L93 Difference]: Finished difference Result 378 states and 522 transitions. [2024-11-07 10:44:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 10:44:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) Word has length 127 [2024-11-07 10:44:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:36,628 INFO L225 Difference]: With dead ends: 378 [2024-11-07 10:44:36,628 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 10:44:36,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 279 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:44:36,632 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 457 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:36,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 529 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:44:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 10:44:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2024-11-07 10:44:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 128 states have internal predecessors, (161), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2024-11-07 10:44:36,653 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 127 [2024-11-07 10:44:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:36,653 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2024-11-07 10:44:36,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 7 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 4 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-07 10:44:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2024-11-07 10:44:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:44:36,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:36,655 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:36,675 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 10:44:36,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:44:36,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:36,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -897657418, now seen corresponding path program 1 times [2024-11-07 10:44:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:36,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576587079] [2024-11-07 10:44:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 10:44:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576587079] [2024-11-07 10:44:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576587079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:44:38,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570885521] [2024-11-07 10:44:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:38,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:44:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:38,017 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 10:44:38,019 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 10:44:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:38,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 10:44:38,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:44:38,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:44:38,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:44:38,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:44:38,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:44:38,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:38,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:44:39,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:39,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:44:39,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:39,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:44:39,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:39,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:44:39,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 66 [2024-11-07 10:44:39,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 91 [2024-11-07 10:44:39,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2024-11-07 10:44:39,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 159 [2024-11-07 10:44:39,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 179 [2024-11-07 10:44:39,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 193 [2024-11-07 10:44:39,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:39,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 327 treesize of output 200 [2024-11-07 10:44:40,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:40,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 338 treesize of output 217 [2024-11-07 10:44:40,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:40,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 349 treesize of output 220 [2024-11-07 10:44:41,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:41,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 348 treesize of output 156 [2024-11-07 10:44:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 210 proven. 60 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-07 10:44:42,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:44:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-07 10:44:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570885521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:44:42,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:44:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 14] total 37 [2024-11-07 10:44:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9629921] [2024-11-07 10:44:42,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:44:42,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 10:44:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:42,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 10:44:42,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1081, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 10:44:42,790 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 37 states, 32 states have (on average 4.6875) internal successors, (150), 37 states have internal predecessors, (150), 12 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 12 states have call successors, (45) [2024-11-07 10:44:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:44,906 INFO L93 Difference]: Finished difference Result 308 states and 402 transitions. [2024-11-07 10:44:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-07 10:44:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 4.6875) internal successors, (150), 37 states have internal predecessors, (150), 12 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 12 states have call successors, (45) Word has length 127 [2024-11-07 10:44:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:44,908 INFO L225 Difference]: With dead ends: 308 [2024-11-07 10:44:44,909 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 10:44:44,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=701, Invalid=2839, Unknown=0, NotChecked=0, Total=3540 [2024-11-07 10:44:44,914 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 431 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:44,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 731 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 10:44:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 10:44:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 147. [2024-11-07 10:44:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 118 states have internal predecessors, (147), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 10:44:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 189 transitions. [2024-11-07 10:44:44,930 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 189 transitions. Word has length 127 [2024-11-07 10:44:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:44,931 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 189 transitions. [2024-11-07 10:44:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 4.6875) internal successors, (150), 37 states have internal predecessors, (150), 12 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 7 states have call predecessors, (45), 12 states have call successors, (45) [2024-11-07 10:44:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 189 transitions. [2024-11-07 10:44:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:44:44,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:44,933 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:44,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:44:45,136 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 10:44:45,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:45,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1846735054, now seen corresponding path program 1 times [2024-11-07 10:44:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848399083] [2024-11-07 10:44:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:45,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848399083] [2024-11-07 10:44:45,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848399083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:45,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:45,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:45,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701005918] [2024-11-07 10:44:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:45,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:45,594 INFO L87 Difference]: Start difference. First operand 147 states and 189 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:45,947 INFO L93 Difference]: Finished difference Result 294 states and 376 transitions. [2024-11-07 10:44:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:44:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-07 10:44:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:45,950 INFO L225 Difference]: With dead ends: 294 [2024-11-07 10:44:45,950 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 10:44:45,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:44:45,951 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 98 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:45,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 544 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:44:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 10:44:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-11-07 10:44:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.2255639097744362) internal successors, (163), 134 states have internal predecessors, (163), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 10:44:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2024-11-07 10:44:45,970 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 127 [2024-11-07 10:44:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:45,971 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2024-11-07 10:44:45,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2024-11-07 10:44:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:44:45,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:45,972 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:45,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:44:45,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:45,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 444245874, now seen corresponding path program 1 times [2024-11-07 10:44:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814375808] [2024-11-07 10:44:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:46,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814375808] [2024-11-07 10:44:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814375808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738054451] [2024-11-07 10:44:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:46,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:46,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:46,677 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:47,080 INFO L93 Difference]: Finished difference Result 315 states and 400 transitions. [2024-11-07 10:44:47,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:47,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-07 10:44:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:47,084 INFO L225 Difference]: With dead ends: 315 [2024-11-07 10:44:47,084 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 10:44:47,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:47,086 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 115 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:47,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 416 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:44:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 10:44:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2024-11-07 10:44:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 140 states have (on average 1.2142857142857142) internal successors, (170), 141 states have internal predecessors, (170), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2024-11-07 10:44:47,109 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 127 [2024-11-07 10:44:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:47,110 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2024-11-07 10:44:47,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2024-11-07 10:44:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:44:47,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:47,111 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:47,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:44:47,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1582756759, now seen corresponding path program 1 times [2024-11-07 10:44:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118966276] [2024-11-07 10:44:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118966276] [2024-11-07 10:44:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118966276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:47,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:47,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174040230] [2024-11-07 10:44:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:47,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:47,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:47,471 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:47,737 INFO L93 Difference]: Finished difference Result 311 states and 393 transitions. [2024-11-07 10:44:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-07 10:44:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:47,740 INFO L225 Difference]: With dead ends: 311 [2024-11-07 10:44:47,741 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 10:44:47,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:44:47,742 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 106 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:47,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 470 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:44:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 10:44:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-11-07 10:44:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 143 states have internal predecessors, (172), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2024-11-07 10:44:47,767 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 129 [2024-11-07 10:44:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:47,767 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2024-11-07 10:44:47,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:47,768 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2024-11-07 10:44:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:44:47,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:47,768 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:47,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:44:47,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:47,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1584603801, now seen corresponding path program 1 times [2024-11-07 10:44:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122387064] [2024-11-07 10:44:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:49,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122387064] [2024-11-07 10:44:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122387064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:44:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396833684] [2024-11-07 10:44:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:44:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:44:49,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:44:49,387 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:50,649 INFO L93 Difference]: Finished difference Result 257 states and 315 transitions. [2024-11-07 10:44:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:44:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-07 10:44:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:50,652 INFO L225 Difference]: With dead ends: 257 [2024-11-07 10:44:50,654 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 10:44:50,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:44:50,655 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 303 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:50,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 685 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:44:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 10:44:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 188. [2024-11-07 10:44:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 145 states have (on average 1.206896551724138) internal successors, (175), 146 states have internal predecessors, (175), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2024-11-07 10:44:50,676 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 129 [2024-11-07 10:44:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:50,677 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2024-11-07 10:44:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2024-11-07 10:44:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:44:50,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:50,678 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:50,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:44:50,679 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash 192250603, now seen corresponding path program 1 times [2024-11-07 10:44:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:50,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485158606] [2024-11-07 10:44:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485158606] [2024-11-07 10:44:51,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485158606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:51,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:51,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675132280] [2024-11-07 10:44:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:51,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:51,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:51,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:51,161 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:51,402 INFO L93 Difference]: Finished difference Result 317 states and 398 transitions. [2024-11-07 10:44:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:51,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-07 10:44:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:51,405 INFO L225 Difference]: With dead ends: 317 [2024-11-07 10:44:51,407 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:44:51,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:44:51,408 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:51,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 385 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:44:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:44:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 10:44:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 145 states have (on average 1.2) internal successors, (174), 146 states have internal predecessors, (174), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2024-11-07 10:44:51,441 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 129 [2024-11-07 10:44:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:51,442 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2024-11-07 10:44:51,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2024-11-07 10:44:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:44:51,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:51,444 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:44:51,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:51,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:51,444 INFO L85 PathProgramCache]: Analyzing trace with hash 872308973, now seen corresponding path program 1 times [2024-11-07 10:44:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77759550] [2024-11-07 10:44:51,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77759550] [2024-11-07 10:44:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77759550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629000061] [2024-11-07 10:44:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:52,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:52,789 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:53,093 INFO L93 Difference]: Finished difference Result 390 states and 485 transitions. [2024-11-07 10:44:53,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:44:53,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-07 10:44:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:53,096 INFO L225 Difference]: With dead ends: 390 [2024-11-07 10:44:53,096 INFO L226 Difference]: Without dead ends: 261 [2024-11-07 10:44:53,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:44:53,098 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:53,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 627 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:44:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-07 10:44:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 205. [2024-11-07 10:44:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 162 states have (on average 1.2098765432098766) internal successors, (196), 163 states have internal predecessors, (196), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2024-11-07 10:44:53,125 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 129 [2024-11-07 10:44:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:53,125 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2024-11-07 10:44:53,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:44:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2024-11-07 10:44:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 10:44:53,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:53,128 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:44:53,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash 911240428, now seen corresponding path program 1 times [2024-11-07 10:44:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262402617] [2024-11-07 10:44:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:44:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262402617] [2024-11-07 10:44:53,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262402617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:53,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:53,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:44:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032548704] [2024-11-07 10:44:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:53,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:44:53,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:53,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:44:53,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:44:53,744 INFO L87 Difference]: Start difference. First operand 205 states and 256 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:53,964 INFO L93 Difference]: Finished difference Result 351 states and 440 transitions. [2024-11-07 10:44:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:44:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-07 10:44:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:53,966 INFO L225 Difference]: With dead ends: 351 [2024-11-07 10:44:53,966 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 10:44:53,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:53,967 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 89 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:53,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 279 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:44:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 10:44:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-07 10:44:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 163 states have internal predecessors, (195), 30 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:44:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2024-11-07 10:44:53,992 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 131 [2024-11-07 10:44:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:53,992 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2024-11-07 10:44:53,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:44:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2024-11-07 10:44:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 10:44:53,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:53,994 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:44:53,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:44:53,994 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:53,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash 777226922, now seen corresponding path program 1 times [2024-11-07 10:44:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:53,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013910203] [2024-11-07 10:44:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:53,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:44:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:44:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:44:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:44:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:54,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:44:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:44:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 10:44:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013910203] [2024-11-07 10:44:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013910203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:44:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077162473] [2024-11-07 10:44:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:55,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:44:55,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:55,032 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 10:44:55,033 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 10:44:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:55,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-07 10:44:55,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:44:55,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:44:56,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:56,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-07 10:44:56,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:56,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-07 10:44:56,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:56,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-11-07 10:44:56,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2024-11-07 10:44:56,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 78 [2024-11-07 10:44:56,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 109 [2024-11-07 10:44:56,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:56,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 58 [2024-11-07 10:44:56,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:56,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 65 [2024-11-07 10:44:56,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:56,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 75 [2024-11-07 10:44:57,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:57,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 38 [2024-11-07 10:44:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 273 proven. 57 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-07 10:44:57,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:44:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 72 proven. 45 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-07 10:44:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077162473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:44:58,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:44:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 18] total 51 [2024-11-07 10:44:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201270593] [2024-11-07 10:44:58,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:44:58,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-07 10:44:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:58,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-07 10:44:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 10:44:58,798 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand has 51 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 48 states have internal predecessors, (150), 17 states have call successors, (39), 6 states have call predecessors, (39), 12 states have return successors, (39), 11 states have call predecessors, (39), 17 states have call successors, (39) [2024-11-07 10:45:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:01,482 INFO L93 Difference]: Finished difference Result 371 states and 455 transitions. [2024-11-07 10:45:01,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 10:45:01,483 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 48 states have internal predecessors, (150), 17 states have call successors, (39), 6 states have call predecessors, (39), 12 states have return successors, (39), 11 states have call predecessors, (39), 17 states have call successors, (39) Word has length 131 [2024-11-07 10:45:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:01,485 INFO L225 Difference]: With dead ends: 371 [2024-11-07 10:45:01,485 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 10:45:01,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1089, Invalid=4611, Unknown=0, NotChecked=0, Total=5700 [2024-11-07 10:45:01,488 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 287 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:01,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 951 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 10:45:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 10:45:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2024-11-07 10:45:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 168 states have internal predecessors, (199), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 10:45:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 257 transitions. [2024-11-07 10:45:01,522 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 257 transitions. Word has length 131 [2024-11-07 10:45:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 257 transitions. [2024-11-07 10:45:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 3.5714285714285716) internal successors, (150), 48 states have internal predecessors, (150), 17 states have call successors, (39), 6 states have call predecessors, (39), 12 states have return successors, (39), 11 states have call predecessors, (39), 17 states have call successors, (39) [2024-11-07 10:45:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 257 transitions. [2024-11-07 10:45:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:45:01,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:01,524 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:01,545 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 10:45:01,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:01,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:01,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -537522203, now seen corresponding path program 1 times [2024-11-07 10:45:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:01,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599543444] [2024-11-07 10:45:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:01,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:45:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:45:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:45:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:45:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:45:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:45:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:45:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:45:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:45:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:45:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:45:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:45:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:45:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:45:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:45:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:45:01,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:45:01,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599543444] [2024-11-07 10:45:01,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599543444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:01,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:01,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:45:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758012667] [2024-11-07 10:45:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:45:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:45:01,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:45:01,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:45:01,926 INFO L87 Difference]: Start difference. First operand 211 states and 257 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:01,975 INFO L93 Difference]: Finished difference Result 365 states and 447 transitions. [2024-11-07 10:45:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:45:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-11-07 10:45:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:01,981 INFO L225 Difference]: With dead ends: 365 [2024-11-07 10:45:01,981 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 10:45:01,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:45:01,983 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:01,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:45:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 10:45:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2024-11-07 10:45:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 169 states have internal predecessors, (200), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 10:45:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 258 transitions. [2024-11-07 10:45:02,012 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 258 transitions. Word has length 133 [2024-11-07 10:45:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:02,012 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 258 transitions. [2024-11-07 10:45:02,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 258 transitions. [2024-11-07 10:45:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:45:02,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:02,014 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:02,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:45:02,015 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash 879171801, now seen corresponding path program 1 times [2024-11-07 10:45:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878707566] [2024-11-07 10:45:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:45:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1640565109] [2024-11-07 10:45:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:02,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:02,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:02,127 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 10:45:02,129 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 10:45:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:02,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 10:45:02,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:02,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:02,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:02,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:02,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:02,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2024-11-07 10:45:02,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2024-11-07 10:45:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2024-11-07 10:45:02,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:02,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 62 [2024-11-07 10:45:02,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 71 [2024-11-07 10:45:02,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:02,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 97 [2024-11-07 10:45:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:45:02,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:02,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:45:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878707566] [2024-11-07 10:45:02,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:45:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640565109] [2024-11-07 10:45:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640565109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:45:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977563762] [2024-11-07 10:45:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:02,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:45:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:45:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:45:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:45:02,876 INFO L87 Difference]: Start difference. First operand 212 states and 258 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:03,337 INFO L93 Difference]: Finished difference Result 364 states and 446 transitions. [2024-11-07 10:45:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:45:03,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-07 10:45:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:03,339 INFO L225 Difference]: With dead ends: 364 [2024-11-07 10:45:03,339 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 10:45:03,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:45:03,340 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 87 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:03,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 347 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:45:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 10:45:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-07 10:45:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 169 states have (on average 1.1893491124260356) internal successors, (201), 170 states have internal predecessors, (201), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 10:45:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 259 transitions. [2024-11-07 10:45:03,373 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 259 transitions. Word has length 135 [2024-11-07 10:45:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:03,373 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 259 transitions. [2024-11-07 10:45:03,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 259 transitions. [2024-11-07 10:45:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:45:03,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:03,374 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:03,395 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 10:45:03,575 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,SelfDestructingSolverStorable17 [2024-11-07 10:45:03,576 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1580771675, now seen corresponding path program 1 times [2024-11-07 10:45:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743975793] [2024-11-07 10:45:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:45:03,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974014786] [2024-11-07 10:45:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:03,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:03,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:45:03,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 10:45:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:04,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 10:45:04,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:04,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:04,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:04,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:04,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:45:04,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2024-11-07 10:45:04,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2024-11-07 10:45:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2024-11-07 10:45:04,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:04,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 62 [2024-11-07 10:45:04,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:04,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 71 [2024-11-07 10:45:04,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:04,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 74 [2024-11-07 10:45:04,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 87 [2024-11-07 10:45:04,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:04,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 127 [2024-11-07 10:45:04,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2024-11-07 10:45:04,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:04,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 188 treesize of output 56 [2024-11-07 10:45:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:45:04,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:45:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743975793] [2024-11-07 10:45:04,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:45:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974014786] [2024-11-07 10:45:04,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974014786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:04,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:04,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:45:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662650268] [2024-11-07 10:45:04,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:04,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:45:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:45:04,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:45:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:45:04,877 INFO L87 Difference]: Start difference. First operand 213 states and 259 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:06,017 INFO L93 Difference]: Finished difference Result 447 states and 548 transitions. [2024-11-07 10:45:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:45:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-07 10:45:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:06,020 INFO L225 Difference]: With dead ends: 447 [2024-11-07 10:45:06,020 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 10:45:06,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:45:06,020 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 217 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:06,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 771 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:45:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 10:45:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 222. [2024-11-07 10:45:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 178 states have (on average 1.196629213483146) internal successors, (213), 179 states have internal predecessors, (213), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 10:45:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2024-11-07 10:45:06,067 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 135 [2024-11-07 10:45:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:06,067 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2024-11-07 10:45:06,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2024-11-07 10:45:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:45:06,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:06,069 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:06,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 10:45:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:06,269 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:06,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 763123225, now seen corresponding path program 1 times [2024-11-07 10:45:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164661481] [2024-11-07 10:45:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:45:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233064927] [2024-11-07 10:45:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:06,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:45:06,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 10:45:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:45:07,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:45:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:45:07,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:45:07,885 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:45:07,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:45:07,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 10:45:08,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:45:08,091 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:08,162 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:45:08,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:45:08 BoogieIcfgContainer [2024-11-07 10:45:08,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:45:08,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:45:08,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:45:08,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:45:08,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:25" (3/4) ... [2024-11-07 10:45:08,169 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:45:08,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:45:08,172 INFO L158 Benchmark]: Toolchain (without parser) took 43846.72ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 91.3MB in the beginning and 64.8MB in the end (delta: 26.4MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2024-11-07 10:45:08,172 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:08,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.41ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 75.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:45:08,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.11ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:08,173 INFO L158 Benchmark]: Boogie Preprocessor took 72.51ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 67.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:45:08,174 INFO L158 Benchmark]: RCFGBuilder took 882.62ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 80.0MB in the end (delta: -12.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-07 10:45:08,175 INFO L158 Benchmark]: TraceAbstraction took 42449.13ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 79.1MB in the beginning and 64.9MB in the end (delta: 14.3MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2024-11-07 10:45:08,175 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 218.1MB. Free memory was 64.9MB in the beginning and 64.8MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:08,176 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.94ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.41ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 75.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.11ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.51ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 67.7MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 882.62ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 80.0MB in the end (delta: -12.4MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 42449.13ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 79.1MB in the beginning and 64.9MB in the end (delta: 14.3MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 218.1MB. Free memory was 64.9MB in the beginning and 64.8MB in the end (delta: 52.6kB). 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 someBinaryFLOATComparisonOperation at line 109. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 8, 59049, 100, 16, -25, 16, 25, -10, 0, 25.1, 2531521428, -128, 256, -16 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L58] EXPR WrapperStruct00.var_1_8 [L58] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_8 [L59] EXPR WrapperStruct00.var_1_14 [L59] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_14 [L60] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L60] EXPR WrapperStruct00.var_1_14 [L60] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L60] signed long int stepLocal_0 = (((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)); [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=4] [L61] COND FALSE !(WrapperStruct00.var_1_2 <= stepLocal_0) [L64] EXPR WrapperStruct00.var_1_10 [L64] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_16 [L66] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L67] EXPR WrapperStruct00.var_1_2 [L67] EXPR WrapperStruct00.var_1_3 [L67] EXPR WrapperStruct00.var_1_15 [L67] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) [L70] EXPR WrapperStruct00.var_1_6 [L70] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L72] EXPR WrapperStruct00.var_1_1 [L72] unsigned char stepLocal_1 = WrapperStruct00.var_1_1; [L73] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L73] COND FALSE !(2.75f > WrapperStruct00.var_1_12) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L76] EXPR ((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8) [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR ((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L76] COND TRUE (WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > stepLocal_1 [L77] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5)) [L77] EXPR WrapperStruct00.var_1_8 [L77] EXPR ((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] EXPR ((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10) [L77] EXPR WrapperStruct00.var_1_10 [L77] EXPR ((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L77] WrapperStruct00.var_1_11 = ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR WrapperStruct00.var_1_2 [L109] EXPR WrapperStruct00.var_1_3 [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_6 [L109] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10))) [L109] EXPR WrapperStruct00.var_1_2 [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR ((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)) [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR (WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1)) [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1) [L109] EXPR WrapperStruct00.var_1_11 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR WrapperStruct00.var_1_8 [L109] EXPR (2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109-L110] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) ^ (WrapperStruct00.var_1_15 * WrapperStruct00.var_1_16)) <= -64) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_6))) && ((WrapperStruct00.var_1_2 <= ((((WrapperStruct00.var_1_14) < 0 ) ? -(WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_14)))) ? (WrapperStruct00.var_1_7 == ((signed char) ((WrapperStruct00.var_1_8 - (1 + WrapperStruct00.var_1_9)) + WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_10)))) && ((2.75f > WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((signed char) (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_8))) : (((WrapperStruct00.var_1_13 - ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_8)))) > WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((signed char) ((((((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) < (WrapperStruct00.var_1_10)) ? (((((WrapperStruct00.var_1_8) < ((1 + 5))) ? (WrapperStruct00.var_1_8) : ((1 + 5))))) : (WrapperStruct00.var_1_10))))) : 1))) && (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_16 == ((signed short int) WrapperStruct00.var_1_14)) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.3s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2659 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2647 mSDsluCounter, 9480 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7263 mSDsCounter, 757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7605 IncrementalHoareTripleChecker+Invalid, 8362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 757 mSolverCounterUnsat, 2217 mSDtfsCounter, 7605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1850 GetRequests, 1586 SyntacticMatches, 13 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=19, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 282 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 3364 NumberOfCodeBlocks, 3364 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3184 ConstructedInterpolants, 1 QuantifiedInterpolants, 21749 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2585 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 10140/10500 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 10:45:08,304 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_variablewrapping_wrapper-s_file-37.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 e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:45:10,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:45:10,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:45:10,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:45:10,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:45:10,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:45:10,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:45:10,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:45:10,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:45:10,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:45:10,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:45:10,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:45:10,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:45:10,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:45:10,500 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:45:10,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:45:10,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:45:10,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:45:10,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:45:10,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:45:10,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:45:10,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:45:10,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:45:10,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:45:10,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:45:10,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:45:10,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:45:10,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:45:10,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:45:10,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:45:10,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:45:10,505 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 -> e1208277e71e1c3dcb7bf16b04051e4f527abbe326e9bfc724844bd2d70dc86a [2024-11-07 10:45:10,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:45:10,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:45:10,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:45:10,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:45:10,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:45:10,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2024-11-07 10:45:12,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:45:12,321 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:45:12,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i [2024-11-07 10:45:12,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d255a7f3/43055117f32b44b39c27efd16758b064/FLAG17cf51400 [2024-11-07 10:45:12,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d255a7f3/43055117f32b44b39c27efd16758b064 [2024-11-07 10:45:12,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:45:12,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:45:12,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:45:12,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:45:12,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:45:12,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34384b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12, skipping insertion in model container [2024-11-07 10:45:12,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:45:12,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i[916,929] [2024-11-07 10:45:12,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:45:12,609 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:45:12,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-37.i[916,929] [2024-11-07 10:45:12,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:45:12,715 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:45:12,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12 WrapperNode [2024-11-07 10:45:12,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:45:12,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:45:12,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:45:12,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:45:12,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,791 INFO L138 Inliner]: procedures = 37, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2024-11-07 10:45:12,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:45:12,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:45:12,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:45:12,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:45:12,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,843 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-07 10:45:12,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:45:12,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:45:12,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:45:12,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:45:12,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (1/1) ... [2024-11-07 10:45:12,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:45:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:12,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:45:12,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:45:12,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:45:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:45:12,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:45:12,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:45:13,090 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:45:13,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:45:13,657 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-07 10:45:13,658 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:45:13,671 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:45:13,673 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:45:13,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:45:13 BoogieIcfgContainer [2024-11-07 10:45:13,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:45:13,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:45:13,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:45:13,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:45:13,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:45:12" (1/3) ... [2024-11-07 10:45:13,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de5a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:45:13, skipping insertion in model container [2024-11-07 10:45:13,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:12" (2/3) ... [2024-11-07 10:45:13,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de5a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:45:13, skipping insertion in model container [2024-11-07 10:45:13,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:45:13" (3/3) ... [2024-11-07 10:45:13,684 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-37.i [2024-11-07 10:45:13,696 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:45:13,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:45:13,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:45:13,767 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;@5be016b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:45:13,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:45:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 80 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:45:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:45:13,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:13,784 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:13,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:13,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1800358953, now seen corresponding path program 1 times [2024-11-07 10:45:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862512356] [2024-11-07 10:45:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:13,798 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 10:45:13,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:13,800 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 10:45:13,801 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 10:45:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:14,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:45:14,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-07 10:45:14,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:14,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862512356] [2024-11-07 10:45:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862512356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:14,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:45:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492641766] [2024-11-07 10:45:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:14,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:45:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:45:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:45:14,178 INFO L87 Difference]: Start difference. First operand has 97 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 80 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:45:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:14,211 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2024-11-07 10:45:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:45:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-11-07 10:45:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:14,218 INFO L225 Difference]: With dead ends: 187 [2024-11-07 10:45:14,218 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:45:14,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:45:14,226 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:14,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:45:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:45:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 10:45:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:45:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-07 10:45:14,264 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 122 [2024-11-07 10:45:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:14,264 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-07 10:45:14,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 10:45:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-07 10:45:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:45:14,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:14,267 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:14,275 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 10:45:14,467 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 10:45:14,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:14,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:14,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1485094405, now seen corresponding path program 1 times [2024-11-07 10:45:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:14,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390296397] [2024-11-07 10:45:14,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:14,469 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 10:45:14,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:14,472 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 10:45:14,473 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 10:45:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:14,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:45:14,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:45:14,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:14,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390296397] [2024-11-07 10:45:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390296397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:45:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786400317] [2024-11-07 10:45:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:45:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:14,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:45:14,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:45:14,849 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:14,928 INFO L93 Difference]: Finished difference Result 188 states and 270 transitions. [2024-11-07 10:45:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:45:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-07 10:45:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:14,934 INFO L225 Difference]: With dead ends: 188 [2024-11-07 10:45:14,934 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:45:14,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:45:14,935 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:14,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:45:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:45:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-07 10:45:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:45:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-07 10:45:14,954 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 122 [2024-11-07 10:45:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-07 10:45:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-07 10:45:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:45:14,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:14,960 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:14,968 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 10:45:15,160 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 10:45:15,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:15,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:15,162 INFO L85 PathProgramCache]: Analyzing trace with hash -805036035, now seen corresponding path program 1 times [2024-11-07 10:45:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565693047] [2024-11-07 10:45:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:15,163 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 10:45:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:15,166 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 10:45:15,168 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 10:45:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:15,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:45:15,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:45:15,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:15,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:15,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565693047] [2024-11-07 10:45:15,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565693047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:15,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:45:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007509555] [2024-11-07 10:45:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:45:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:45:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:45:15,463 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:15,546 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2024-11-07 10:45:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:45:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-07 10:45:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:15,549 INFO L225 Difference]: With dead ends: 194 [2024-11-07 10:45:15,550 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 10:45:15,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:45:15,552 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:15,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 610 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:45:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 10:45:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-07 10:45:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:45:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-11-07 10:45:15,571 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 122 [2024-11-07 10:45:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:15,571 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-11-07 10:45:15,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-11-07 10:45:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:45:15,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:15,573 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:15,583 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 10:45:15,779 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 10:45:15,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:15,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 969971327, now seen corresponding path program 1 times [2024-11-07 10:45:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950299825] [2024-11-07 10:45:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:15,781 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 10:45:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:15,784 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 10:45:15,785 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 10:45:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:16,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:45:16,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:45:16,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:16,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950299825] [2024-11-07 10:45:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950299825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:16,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:45:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895555745] [2024-11-07 10:45:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:45:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:45:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:45:16,082 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:16,173 INFO L93 Difference]: Finished difference Result 198 states and 279 transitions. [2024-11-07 10:45:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:45:16,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-11-07 10:45:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:16,177 INFO L225 Difference]: With dead ends: 198 [2024-11-07 10:45:16,177 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 10:45:16,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:45:16,180 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:16,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 725 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:45:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 10:45:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-07 10:45:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:45:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-11-07 10:45:16,190 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 122 [2024-11-07 10:45:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:16,191 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-11-07 10:45:16,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:45:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-07 10:45:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:45:16,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:16,199 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:16,207 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 10:45:16,399 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 10:45:16,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 971818369, now seen corresponding path program 1 times [2024-11-07 10:45:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246493106] [2024-11-07 10:45:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:16,401 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 10:45:16,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:16,405 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 10:45:16,406 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 10:45:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:16,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:45:16,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:16,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:45:16,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:45:16,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:45:16,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-07 10:45:17,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-07 10:45:17,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-07 10:45:17,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-07 10:45:17,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-07 10:45:17,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 53 [2024-11-07 10:45:17,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 30 [2024-11-07 10:45:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-07 10:45:17,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:45:18,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246493106] [2024-11-07 10:45:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246493106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:45:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1307098780] [2024-11-07 10:45:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:18,230 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:45:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:45:18,234 INFO L229 MonitoredProcess]: Starting monitored process 7 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 10:45:18,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-07 10:45:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:18,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 10:45:18,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:18,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:45:19,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:45:19,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-07 10:45:19,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-07 10:45:19,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:19,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-07 10:45:20,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:20,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 48 [2024-11-07 10:45:20,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:20,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 46 [2024-11-07 10:45:20,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:20,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 46 [2024-11-07 10:45:21,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2024-11-07 10:45:21,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:21,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 41 [2024-11-07 10:45:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 289 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-07 10:45:21,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:45:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1307098780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:45:21,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:45:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2024-11-07 10:45:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709535407] [2024-11-07 10:45:21,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:45:21,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 10:45:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 10:45:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 10:45:21,685 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 27 states, 23 states have (on average 4.478260869565218) internal successors, (103), 26 states have internal predecessors, (103), 10 states have call successors, (30), 9 states have call predecessors, (30), 10 states have return successors, (30), 6 states have call predecessors, (30), 10 states have call successors, (30) [2024-11-07 10:45:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:25,047 INFO L93 Difference]: Finished difference Result 227 states and 302 transitions. [2024-11-07 10:45:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 10:45:25,049 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.478260869565218) internal successors, (103), 26 states have internal predecessors, (103), 10 states have call successors, (30), 9 states have call predecessors, (30), 10 states have return successors, (30), 6 states have call predecessors, (30), 10 states have call successors, (30) Word has length 122 [2024-11-07 10:45:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:25,051 INFO L225 Difference]: With dead ends: 227 [2024-11-07 10:45:25,051 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 10:45:25,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=546, Invalid=2004, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 10:45:25,054 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 207 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:25,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 616 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 10:45:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 10:45:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2024-11-07 10:45:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:45:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2024-11-07 10:45:25,074 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 154 transitions. Word has length 122 [2024-11-07 10:45:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 154 transitions. [2024-11-07 10:45:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.478260869565218) internal successors, (103), 26 states have internal predecessors, (103), 10 states have call successors, (30), 9 states have call predecessors, (30), 10 states have return successors, (30), 6 states have call predecessors, (30), 10 states have call successors, (30) [2024-11-07 10:45:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 154 transitions. [2024-11-07 10:45:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:45:25,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:25,078 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:25,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-07 10:45:25,287 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 10:45:25,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 10:45:25,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:25,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1394520195, now seen corresponding path program 1 times [2024-11-07 10:45:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404842739] [2024-11-07 10:45:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:25,480 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 10:45:25,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:25,482 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 10:45:25,483 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 10:45:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:25,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 10:45:25,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:25,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:45:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19