./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.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-38.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', 'a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149'] 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-38.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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:44:25,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:44:25,235 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:25,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:44:25,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:44:25,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:44:25,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:44:25,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:44:25,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:44:25,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:44:25,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:44:25,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:44:25,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:44:25,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:44:25,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:44:25,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:44:25,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:44:25,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:44:25,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:44:25,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:44:25,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:44:25,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:44:25,269 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-11-07 10:44:25,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:44:25,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:44:25,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:44:25,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:44:25,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:44:25,586 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-38.i [2024-11-07 10:44:26,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:44:27,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:44:27,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-07 10:44:27,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0f4715d/465081698fb446cb81dbe6eb51377996/FLAG7de62c5d9 [2024-11-07 10:44:27,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0f4715d/465081698fb446cb81dbe6eb51377996 [2024-11-07 10:44:27,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:44:27,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:44:27,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:44:27,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:44:27,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:44:27,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:27" (1/1) ... [2024-11-07 10:44:27,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a788573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:27, skipping insertion in model container [2024-11-07 10:44:27,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:27" (1/1) ... [2024-11-07 10:44:27,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:44:27,355 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-38.i[916,929] [2024-11-07 10:44:27,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:44:27,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:44:27,453 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-38.i[916,929] [2024-11-07 10:44:27,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:44:27,515 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:44:27,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:27 WrapperNode [2024-11-07 10:44:27,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:44:27,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:44:27,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:44:27,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:44:27,524 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:27" (1/1) ... [2024-11-07 10:44:27,540 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:27" (1/1) ... [2024-11-07 10:44:27,598 INFO L138 Inliner]: procedures = 30, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-11-07 10:44:27,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:44:27,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:44:27,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:44:27,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:44:27,609 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:27" (1/1) ... [2024-11-07 10:44:27,609 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:27" (1/1) ... [2024-11-07 10:44:27,621 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:27" (1/1) ... [2024-11-07 10:44:27,628 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:44:27,629 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:27" (1/1) ... [2024-11-07 10:44:27,629 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:27" (1/1) ... [2024-11-07 10:44:27,656 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:27" (1/1) ... [2024-11-07 10:44:27,660 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:27" (1/1) ... [2024-11-07 10:44:27,663 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:27" (1/1) ... [2024-11-07 10:44:27,665 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:27" (1/1) ... [2024-11-07 10:44:27,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:44:27,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:44:27,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:44:27,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:44:27,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:27" (1/1) ... [2024-11-07 10:44:27,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:44:27,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:27,704 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:27,706 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:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:44:27,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:44:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:44:27,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:44:27,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:44:27,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:44:27,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:44:28,406 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-07 10:44:28,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:44:28,417 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:44:28,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:44:28,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:28 BoogieIcfgContainer [2024-11-07 10:44:28,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:44:28,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:44:28,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:44:28,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:44:28,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:44:27" (1/3) ... [2024-11-07 10:44:28,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d23f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:28, skipping insertion in model container [2024-11-07 10:44:28,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:27" (2/3) ... [2024-11-07 10:44:28,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d23f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:28, skipping insertion in model container [2024-11-07 10:44:28,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:28" (3/3) ... [2024-11-07 10:44:28,428 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-11-07 10:44:28,440 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:44:28,441 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:44:28,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:44:28,504 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;@44062a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:44:28,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:44:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:44:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:28,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:28,524 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1590797153, now seen corresponding path program 1 times [2024-11-07 10:44:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693008017] [2024-11-07 10:44:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693008017] [2024-11-07 10:44:29,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693008017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:29,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:29,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:44:29,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054591298] [2024-11-07 10:44:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:29,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:44:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:44:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:44:29,177 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:44:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:29,205 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-07 10:44:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:44:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-07 10:44:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:29,216 INFO L225 Difference]: With dead ends: 237 [2024-11-07 10:44:29,216 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 10:44:29,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:29,223 INFO L432 NwaCegarLoop]: 172 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, 172 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:29,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 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:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 10:44:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 10:44:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:44:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-07 10:44:29,267 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-07 10:44:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:29,267 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-07 10:44:29,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:44:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-07 10:44:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:29,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:29,271 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:44:29,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:29,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash 798915143, now seen corresponding path program 1 times [2024-11-07 10:44:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67846058] [2024-11-07 10:44:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:29,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67846058] [2024-11-07 10:44:29,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67846058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:29,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:44:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173616570] [2024-11-07 10:44:29,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:29,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:44:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:44:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:29,811 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:44:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:29,876 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-11-07 10:44:29,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:44:29,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-07 10:44:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:29,878 INFO L225 Difference]: With dead ends: 235 [2024-11-07 10:44:29,879 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:44:29,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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:29,880 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:29,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:44:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:44:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:44:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:44:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-11-07 10:44:29,906 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 184 [2024-11-07 10:44:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:29,907 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-11-07 10:44:29,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:44:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-11-07 10:44:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:29,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:29,915 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:44:29,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:29,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash -928229819, now seen corresponding path program 1 times [2024-11-07 10:44:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:29,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876882753] [2024-11-07 10:44:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:30,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:30,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876882753] [2024-11-07 10:44:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876882753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:30,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:30,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:44:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284890217] [2024-11-07 10:44:30,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:30,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:44:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:44:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:44:30,322 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 10:44:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:30,369 INFO L93 Difference]: Finished difference Result 240 states and 349 transitions. [2024-11-07 10:44:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:44:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2024-11-07 10:44:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:30,373 INFO L225 Difference]: With dead ends: 240 [2024-11-07 10:44:30,373 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 10:44:30,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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:30,375 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 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:30,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 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:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 10:44:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-07 10:44:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:44:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-11-07 10:44:30,389 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 184 [2024-11-07 10:44:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:30,390 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-11-07 10:44:30,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 10:44:30,390 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-11-07 10:44:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:30,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:30,397 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:44:30,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:30,397 INFO L85 PathProgramCache]: Analyzing trace with hash -248171449, now seen corresponding path program 1 times [2024-11-07 10:44:30,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897687669] [2024-11-07 10:44:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:30,638 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 5 [2024-11-07 10:44:32,525 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 11 [2024-11-07 10:44:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:32,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897687669] [2024-11-07 10:44:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897687669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:32,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:44:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774821186] [2024-11-07 10:44:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:32,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:44:32,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:44:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:44:32,597 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:44:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:33,242 INFO L93 Difference]: Finished difference Result 328 states and 474 transitions. [2024-11-07 10:44:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:44:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-07 10:44:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:33,247 INFO L225 Difference]: With dead ends: 328 [2024-11-07 10:44:33,248 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 10:44:33,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 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:33,251 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 197 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:33,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 419 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:44:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 10:44:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-07 10:44:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 167 states have (on average 1.341317365269461) internal successors, (224), 168 states have internal predecessors, (224), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:44:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2024-11-07 10:44:33,285 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 184 [2024-11-07 10:44:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2024-11-07 10:44:33,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:44:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2024-11-07 10:44:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:33,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:33,290 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:44:33,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:33,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1745863815, now seen corresponding path program 1 times [2024-11-07 10:44:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:33,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655665591] [2024-11-07 10:44:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655665591] [2024-11-07 10:44:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655665591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:44:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146380623] [2024-11-07 10:44:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:44:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:44:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:44:36,808 INFO L87 Difference]: Start difference. First operand 206 states and 296 transitions. Second operand has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-07 10:44:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:38,434 INFO L93 Difference]: Finished difference Result 491 states and 704 transitions. [2024-11-07 10:44:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:44:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-07 10:44:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:38,441 INFO L225 Difference]: With dead ends: 491 [2024-11-07 10:44:38,441 INFO L226 Difference]: Without dead ends: 288 [2024-11-07 10:44:38,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:44:38,443 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 50 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:38,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 970 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 10:44:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-07 10:44:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 228. [2024-11-07 10:44:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.343915343915344) internal successors, (254), 190 states have internal predecessors, (254), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:44:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 326 transitions. [2024-11-07 10:44:38,471 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 326 transitions. Word has length 184 [2024-11-07 10:44:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:38,471 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 326 transitions. [2024-11-07 10:44:38,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-07 10:44:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 326 transitions. [2024-11-07 10:44:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:38,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:38,475 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:44:38,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:38,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1159057801, now seen corresponding path program 1 times [2024-11-07 10:44:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625146227] [2024-11-07 10:44:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625146227] [2024-11-07 10:44:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625146227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:44:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903080075] [2024-11-07 10:44:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:41,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:44:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:44:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:44:41,065 INFO L87 Difference]: Start difference. First operand 228 states and 326 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 10:44:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:42,092 INFO L93 Difference]: Finished difference Result 505 states and 722 transitions. [2024-11-07 10:44:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:44:42,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-07 10:44:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:42,098 INFO L225 Difference]: With dead ends: 505 [2024-11-07 10:44:42,098 INFO L226 Difference]: Without dead ends: 280 [2024-11-07 10:44:42,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:44:42,101 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:42,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 900 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:44:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-07 10:44:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 228. [2024-11-07 10:44:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3333333333333333) internal successors, (252), 190 states have internal predecessors, (252), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:44:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 324 transitions. [2024-11-07 10:44:42,127 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 324 transitions. Word has length 184 [2024-11-07 10:44:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:42,128 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 324 transitions. [2024-11-07 10:44:42,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 10:44:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 324 transitions. [2024-11-07 10:44:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:42,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:42,130 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:44:42,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1964718533, now seen corresponding path program 1 times [2024-11-07 10:44:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:42,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695814159] [2024-11-07 10:44:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:42,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695814159] [2024-11-07 10:44:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695814159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:44,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:44:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524840493] [2024-11-07 10:44:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:44,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:44:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:44:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:44:44,391 INFO L87 Difference]: Start difference. First operand 228 states and 324 transitions. Second operand has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 10:44:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:45,510 INFO L93 Difference]: Finished difference Result 505 states and 718 transitions. [2024-11-07 10:44:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:44:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2024-11-07 10:44:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:45,513 INFO L225 Difference]: With dead ends: 505 [2024-11-07 10:44:45,513 INFO L226 Difference]: Without dead ends: 280 [2024-11-07 10:44:45,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:44:45,514 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:45,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 834 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:44:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-07 10:44:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 228. [2024-11-07 10:44:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 190 states have internal predecessors, (250), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:44:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2024-11-07 10:44:45,533 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 184 [2024-11-07 10:44:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:45,534 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2024-11-07 10:44:45,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.4) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 10:44:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2024-11-07 10:44:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:44:45,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:45,537 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:44:45,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1377912519, now seen corresponding path program 1 times [2024-11-07 10:44:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481476959] [2024-11-07 10:44:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:44:47,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:47,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481476959] [2024-11-07 10:44:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481476959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:44:47,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:44:47,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:44:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140375713] [2024-11-07 10:44:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:44:47,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:44:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:47,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:44:47,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:44:47,785 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-07 10:44:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:49,426 INFO L93 Difference]: Finished difference Result 517 states and 728 transitions. [2024-11-07 10:44:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:44:49,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2024-11-07 10:44:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:49,430 INFO L225 Difference]: With dead ends: 517 [2024-11-07 10:44:49,430 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 10:44:49,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:44:49,434 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 54 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:49,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1255 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 10:44:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 10:44:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-07 10:44:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 243 states have (on average 1.3333333333333333) internal successors, (324), 246 states have internal predecessors, (324), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:44:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2024-11-07 10:44:49,455 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 184 [2024-11-07 10:44:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:49,457 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2024-11-07 10:44:49,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-07 10:44:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2024-11-07 10:44:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 10:44:49,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:49,461 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:44:49,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1715445312, now seen corresponding path program 1 times [2024-11-07 10:44:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:49,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347397200] [2024-11-07 10:44:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:44:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:44:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:44:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:44:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:44:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:44:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:44:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:44:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:44:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:44:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:44:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:44:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:44:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:44:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:44:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:44:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:44:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:44:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:44:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:44:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:44:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:44:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:44:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:44:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 18 proven. 114 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-07 10:44:52,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:44:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347397200] [2024-11-07 10:44:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347397200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:44:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360073470] [2024-11-07 10:44:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:44:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:44:52,354 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:52,355 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:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:44:52,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-07 10:44:52,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:44:52,882 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:53,039 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:53,118 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:53,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,333 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 34 treesize of output 25 [2024-11-07 10:44:53,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,449 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 34 treesize of output 25 [2024-11-07 10:44:53,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,542 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 34 treesize of output 25 [2024-11-07 10:44:53,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,635 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 34 treesize of output 25 [2024-11-07 10:44:53,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,724 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 34 treesize of output 25 [2024-11-07 10:44:53,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,808 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 34 treesize of output 25 [2024-11-07 10:44:53,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:53,924 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 34 treesize of output 25 [2024-11-07 10:44:54,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:54,043 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 34 treesize of output 25 [2024-11-07 10:44:54,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:54,166 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 34 treesize of output 25 [2024-11-07 10:44:54,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:54,292 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 34 treesize of output 25 [2024-11-07 10:44:54,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:54,413 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 34 treesize of output 25 [2024-11-07 10:44:54,562 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 34 treesize of output 25 [2024-11-07 10:44:54,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:44:54,625 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 71 treesize of output 64 [2024-11-07 10:44:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 344 proven. 120 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-07 10:44:54,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:44:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-07 10:44:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360073470] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:44:55,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:44:55,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 31 [2024-11-07 10:44:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049738290] [2024-11-07 10:44:55,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:44:55,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 10:44:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:44:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 10:44:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:44:55,381 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 31 states, 25 states have (on average 7.0) internal successors, (175), 31 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) [2024-11-07 10:44:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:44:57,943 INFO L93 Difference]: Finished difference Result 621 states and 842 transitions. [2024-11-07 10:44:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 10:44:57,944 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 7.0) internal successors, (175), 31 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) Word has length 186 [2024-11-07 10:44:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:44:57,947 INFO L225 Difference]: With dead ends: 621 [2024-11-07 10:44:57,948 INFO L226 Difference]: Without dead ends: 336 [2024-11-07 10:44:57,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=583, Invalid=2387, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 10:44:57,951 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 693 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:44:57,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 721 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 10:44:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-07 10:44:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 252. [2024-11-07 10:44:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 205 states have (on average 1.278048780487805) internal successors, (262), 206 states have internal predecessors, (262), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:44:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 334 transitions. [2024-11-07 10:44:57,977 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 334 transitions. Word has length 186 [2024-11-07 10:44:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:44:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 334 transitions. [2024-11-07 10:44:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 7.0) internal successors, (175), 31 states have internal predecessors, (175), 14 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 8 states have call predecessors, (72), 14 states have call successors, (72) [2024-11-07 10:44:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 334 transitions. [2024-11-07 10:44:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 10:44:57,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:44:57,984 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:44:58,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:44:58,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:44:58,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:44:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1496590594, now seen corresponding path program 1 times [2024-11-07 10:44:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:44:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653589193] [2024-11-07 10:44:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:44:58,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:44:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:45:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:45:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:45:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:45:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:45:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:45:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:45:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:45:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:45:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:45:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:45:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:45:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:45:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:45:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:45:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:45:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:45:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:45:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:45:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 10:45:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 10:45:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:45:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:45:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 10:45:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 10:45:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:45:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653589193] [2024-11-07 10:45:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653589193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:45:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620665887] [2024-11-07 10:45:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:45:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:45:01,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:45:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:45:01,205 INFO L87 Difference]: Start difference. First operand 252 states and 334 transitions. Second operand has 13 states, 8 states have (on average 8.625) internal successors, (69), 13 states have internal predecessors, (69), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-07 10:45:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:02,589 INFO L93 Difference]: Finished difference Result 511 states and 677 transitions. [2024-11-07 10:45:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:45:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 8.625) internal successors, (69), 13 states have internal predecessors, (69), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) Word has length 186 [2024-11-07 10:45:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:02,592 INFO L225 Difference]: With dead ends: 511 [2024-11-07 10:45:02,592 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 10:45:02,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:45:02,594 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 56 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:45:02,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1046 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:45:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 10:45:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2024-11-07 10:45:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 211 states have (on average 1.2701421800947867) internal successors, (268), 212 states have internal predecessors, (268), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:45:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 340 transitions. [2024-11-07 10:45:02,623 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 340 transitions. Word has length 186 [2024-11-07 10:45:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:02,623 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 340 transitions. [2024-11-07 10:45:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 8.625) internal successors, (69), 13 states have internal predecessors, (69), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-07 10:45:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 340 transitions. [2024-11-07 10:45:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-07 10:45:02,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:02,627 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:45:02,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:02,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:02,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1238425156, now seen corresponding path program 1 times [2024-11-07 10:45:02,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:45:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748028748] [2024-11-07 10:45:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:45:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:45:02,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:45:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:45:02,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:45:02,922 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:45:02,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:45:02,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:45:02,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:45:03,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:45:03,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:45:03 BoogieIcfgContainer [2024-11-07 10:45:03,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:45:03,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:45:03,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:45:03,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:45:03,010 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:28" (3/4) ... [2024-11-07 10:45:03,012 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:45:03,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:45:03,014 INFO L158 Benchmark]: Toolchain (without parser) took 35819.98ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 91.7MB in the beginning and 889.3MB in the end (delta: -797.6MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2024-11-07 10:45:03,015 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:03,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.86ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 73.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:45:03,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.72ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 68.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:45:03,015 INFO L158 Benchmark]: Boogie Preprocessor took 73.27ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:03,017 INFO L158 Benchmark]: RCFGBuilder took 743.78ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 76.1MB in the end (delta: -10.6MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-07 10:45:03,017 INFO L158 Benchmark]: TraceAbstraction took 34586.43ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 75.2MB in the beginning and 889.6MB in the end (delta: -814.4MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. [2024-11-07 10:45:03,018 INFO L158 Benchmark]: Witness Printer took 5.07ms. Allocated memory is still 1.0GB. Free memory was 889.6MB in the beginning and 889.3MB in the end (delta: 277.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:45:03,018 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.81ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.86ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 73.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.72ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 68.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.27ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 743.78ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 76.1MB in the end (delta: -10.6MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 34586.43ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 75.2MB in the beginning and 889.6MB in the end (delta: -814.4MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. * Witness Printer took 5.07ms. Allocated memory is still 1.0GB. Free memory was 889.6MB in the beginning and 889.3MB in the end (delta: 277.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73. Possible FailurePath: [L43] unsigned char isInitial = 0; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 0, 56507, 52902, 8, 16, 1771558822, 7.25, 31.2, 32.71, 0.4, 7.75, 32, 0, 20114, 32, 16773, 25, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] 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] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] 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] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) 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_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1610612735) 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_6 >= 1610612735) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 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] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_9 [L104] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 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] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_10 [L106] EXPR WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 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] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 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] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16384) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR WrapperStruct00.var_1_4 [L68] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4) [L69] EXPR WrapperStruct00.var_1_2 [L69] unsigned short int stepLocal_0 = WrapperStruct00.var_1_2; [L70] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-2] [L70] COND FALSE !(WrapperStruct00.var_1_4 > stepLocal_0) [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] EXPR WrapperStruct00.var_1_11 [L73] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))) [L74] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L74] COND TRUE ! WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L83] EXPR WrapperStruct00.var_1_19 [L83] unsigned char stepLocal_1 = WrapperStruct00.var_1_19; [L84] EXPR WrapperStruct00.var_1_13 [L84] EXPR WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=-256] [L84] COND FALSE !((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && stepLocal_1) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) [L131] EXPR WrapperStruct00.var_1_7 [L131] EXPR WrapperStruct00.var_1_8 [L131] EXPR WrapperStruct00.var_1_9 [L131] EXPR WrapperStruct00.var_1_10 [L131] EXPR WrapperStruct00.var_1_11 [L131] EXPR ((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((WrapperStruct00.var_1_1 == ((unsigned short int) (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3))) - WrapperStruct00.var_1_4))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_5 == ((unsigned long int) (((WrapperStruct00.var_1_6 - WrapperStruct00.var_1_3) + 2144048120u) - WrapperStruct00.var_1_2))) : 1)) && (WrapperStruct00.var_1_7 == ((double) (WrapperStruct00.var_1_8 + (WrapperStruct00.var_1_9 + (WrapperStruct00.var_1_10 + WrapperStruct00.var_1_11)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned short int) (WrapperStruct00.var_1_3 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_12 == ((unsigned short int) ((27636 + WrapperStruct00.var_1_16) - (((((16853 - 10)) > (WrapperStruct00.var_1_14)) ? ((16853 - 10)) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_12 == ((unsigned short int) WrapperStruct00.var_1_3))))) && (((WrapperStruct00.var_1_13 && WrapperStruct00.var_1_18) && WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_17 == ((unsigned short int) (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_14))) : 1) ; [L141] RET, EXPR property() [L141] 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, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1162 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1146 mSDsluCounter, 7312 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5788 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4871 IncrementalHoareTripleChecker+Invalid, 5097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 1524 mSDtfsCounter, 4871 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1108 GetRequests, 996 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=8, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 260 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2204 ConstructedInterpolants, 0 QuantifiedInterpolants, 9939 SizeOfPredicates, 3 NumberOfNonLiveVariables, 665 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 12891/13248 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:03,051 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-38.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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:45:05,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:45:05,470 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:05,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:45:05,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:45:05,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:45:05,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:45:05,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:45:05,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:45:05,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:45:05,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:45:05,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:45:05,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:45:05,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:45:05,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:45:05,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:45:05,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:45:05,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:45:05,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:45:05,503 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:45:05,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:45:05,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:45:05,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:45:05,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:45:05,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:45:05,504 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-11-07 10:45:05,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:45:05,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:45:05,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:45:05,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:45:05,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:45:05,791 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-38.i [2024-11-07 10:45:07,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:45:07,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:45:07,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-11-07 10:45:07,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f99ea44ca/90d6c8f6879a4820b915ca4bd07738f9/FLAG203c3304a [2024-11-07 10:45:07,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f99ea44ca/90d6c8f6879a4820b915ca4bd07738f9 [2024-11-07 10:45:07,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:45:07,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:45:07,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:45:07,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:45:07,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:45:07,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:45:07" (1/1) ... [2024-11-07 10:45:07,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28342ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:07, skipping insertion in model container [2024-11-07 10:45:07,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:45:07" (1/1) ... [2024-11-07 10:45:07,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:45:07,872 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-38.i[916,929] [2024-11-07 10:45:07,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:45:07,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:45:07,985 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-38.i[916,929] [2024-11-07 10:45:08,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:45:08,077 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:45:08,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:08 WrapperNode [2024-11-07 10:45:08,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:45:08,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:45:08,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:45:08,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:45:08,088 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:08" (1/1) ... [2024-11-07 10:45:08,110 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:08" (1/1) ... [2024-11-07 10:45:08,158 INFO L138 Inliner]: procedures = 37, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2024-11-07 10:45:08,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:45:08,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:45:08,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:45:08,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:45:08,167 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:08" (1/1) ... [2024-11-07 10:45:08,168 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:08" (1/1) ... [2024-11-07 10:45:08,173 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:08" (1/1) ... [2024-11-07 10:45:08,192 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 41 writes are split as follows [0, 41]. [2024-11-07 10:45:08,193 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:08" (1/1) ... [2024-11-07 10:45:08,193 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:08" (1/1) ... [2024-11-07 10:45:08,222 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:08" (1/1) ... [2024-11-07 10:45:08,231 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:08" (1/1) ... [2024-11-07 10:45:08,237 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:08" (1/1) ... [2024-11-07 10:45:08,245 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:08" (1/1) ... [2024-11-07 10:45:08,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:45:08,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:45:08,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:45:08,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:45:08,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:08" (1/1) ... [2024-11-07 10:45:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:45:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:45:08,286 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:08,288 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:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:45:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:45:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:45:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:45:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:45:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:45:08,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:45:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:45:08,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:45:08,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:45:08,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:45:08,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:45:14,419 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-07 10:45:14,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:45:14,431 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:45:14,431 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:45:14,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:45:14 BoogieIcfgContainer [2024-11-07 10:45:14,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:45:14,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:45:14,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:45:14,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:45:14,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:45:07" (1/3) ... [2024-11-07 10:45:14,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33408240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:45:14, skipping insertion in model container [2024-11-07 10:45:14,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:45:08" (2/3) ... [2024-11-07 10:45:14,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33408240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:45:14, skipping insertion in model container [2024-11-07 10:45:14,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:45:14" (3/3) ... [2024-11-07 10:45:14,445 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-11-07 10:45:14,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:45:14,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:45:14,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:45:14,532 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;@7be8f885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:45:14,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:45:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:45:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:45:14,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:14,549 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:14,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:14,553 INFO L85 PathProgramCache]: Analyzing trace with hash 695157323, now seen corresponding path program 1 times [2024-11-07 10:45:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:14,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046163279] [2024-11-07 10:45:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:14,563 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,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:14,565 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:14,566 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:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:15,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:45:15,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2024-11-07 10:45:15,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:45:15,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:45:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046163279] [2024-11-07 10:45:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046163279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:45:15,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:45:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:45:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645621064] [2024-11-07 10:45:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:45:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:45:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:45:15,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:45:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:45:15,270 INFO L87 Difference]: Start difference. First operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 96 states have internal predecessors, (131), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:45:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:45:15,299 INFO L93 Difference]: Finished difference Result 237 states and 376 transitions. [2024-11-07 10:45:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:45:15,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2024-11-07 10:45:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:45:15,309 INFO L225 Difference]: With dead ends: 237 [2024-11-07 10:45:15,309 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 10:45:15,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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:15,317 INFO L432 NwaCegarLoop]: 172 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, 172 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:15,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 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:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 10:45:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 10:45:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:45:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-07 10:45:15,353 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2024-11-07 10:45:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:45:15,353 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-07 10:45:15,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 10:45:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-07 10:45:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-07 10:45:15,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:45:15,356 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,370 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:15,557 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:15,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:45:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:45:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1210097677, now seen corresponding path program 1 times [2024-11-07 10:45:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:45:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135540876] [2024-11-07 10:45:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:45:15,559 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,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:45:15,564 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:15,565 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:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:45:16,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 10:45:16,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:45:16,431 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,652 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,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,058 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 37 treesize of output 39 [2024-11-07 10:45:17,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:17,993 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 63 treesize of output 47 [2024-11-07 10:45:18,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:18,397 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 74 treesize of output 47 [2024-11-07 10:45:18,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:18,779 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 64 treesize of output 67 [2024-11-07 10:45:23,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:23,383 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 83 treesize of output 68 [2024-11-07 10:45:23,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:23,816 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 73 treesize of output 88 [2024-11-07 10:45:32,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:32,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 104 [2024-11-07 10:45:33,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:33,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 117 [2024-11-07 10:45:34,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:45:34,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 130