./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577'] 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-sp_file-90.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:01:42,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:01:42,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:01:42,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:01:42,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:01:43,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:01:43,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:01:43,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:01:43,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:01:43,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:01:43,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:01:43,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:01:43,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:01:43,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:01:43,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:01:43,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:01:43,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:01:43,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:43,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:01:43,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:01:43,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:01:43,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:01:43,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:01:43,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:01:43,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:01:43,029 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 -> 018e436f7a98b5e0faa97a2819a6cebbd0a6f7e6f554350f973b951d0d48d577 [2024-11-07 11:01:43,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:01:43,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:01:43,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:01:43,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:01:43,268 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:01:43,269 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-sp_file-90.i [2024-11-07 11:01:44,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:01:44,640 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:01:44,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2024-11-07 11:01:44,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0586e41ae/a2c1b44fc00647d3bb0ef9a5d0db6afa/FLAG7cc71098c [2024-11-07 11:01:45,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0586e41ae/a2c1b44fc00647d3bb0ef9a5d0db6afa [2024-11-07 11:01:45,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:01:45,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:01:45,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:45,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:01:45,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:01:45,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94c1161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45, skipping insertion in model container [2024-11-07 11:01:45,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:01:45,113 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-sp_file-90.i[917,930] [2024-11-07 11:01:45,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:45,166 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:01:45,173 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-sp_file-90.i[917,930] [2024-11-07 11:01:45,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:01:45,213 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:01:45,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45 WrapperNode [2024-11-07 11:01:45,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:01:45,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:45,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:01:45,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:01:45,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,258 INFO L138 Inliner]: procedures = 27, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2024-11-07 11:01:45,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:01:45,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:01:45,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:01:45,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:01:45,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,290 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-07 11:01:45,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:01:45,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:01:45,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:01:45,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:01:45,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (1/1) ... [2024-11-07 11:01:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:01:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:01:45,343 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 11:01:45,347 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 11:01:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:01:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:01:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:01:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:01:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 11:01:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:01:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:01:45,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:01:45,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:01:45,929 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2024-11-07 11:01:45,929 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:01:45,939 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:01:45,939 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:01:45,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:45 BoogieIcfgContainer [2024-11-07 11:01:45,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:01:45,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:01:45,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:01:45,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:01:45,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:01:45" (1/3) ... [2024-11-07 11:01:45,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239c3a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:45, skipping insertion in model container [2024-11-07 11:01:45,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:01:45" (2/3) ... [2024-11-07 11:01:45,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239c3a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:01:45, skipping insertion in model container [2024-11-07 11:01:45,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:01:45" (3/3) ... [2024-11-07 11:01:45,946 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-90.i [2024-11-07 11:01:45,961 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:01:45,962 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:01:46,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:01:46,012 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;@46fb50f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:01:46,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:01:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:01:46,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:46,026 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:46,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -28564899, now seen corresponding path program 1 times [2024-11-07 11:01:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571397460] [2024-11-07 11:01:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:46,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571397460] [2024-11-07 11:01:46,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571397460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:46,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:01:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682840012] [2024-11-07 11:01:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:01:46,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:01:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:46,458 INFO L87 Difference]: Start difference. First operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 11:01:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:46,482 INFO L93 Difference]: Finished difference Result 215 states and 336 transitions. [2024-11-07 11:01:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:01:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2024-11-07 11:01:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:46,489 INFO L225 Difference]: With dead ends: 215 [2024-11-07 11:01:46,489 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 11:01:46,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:01:46,497 INFO L432 NwaCegarLoop]: 154 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, 154 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 11:01:46,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 11:01:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-07 11:01:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-11-07 11:01:46,565 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2024-11-07 11:01:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-11-07 11:01:46,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 11:01:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-11-07 11:01:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 11:01:46,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:46,571 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:01:46,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:01:46,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:46,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 856508981, now seen corresponding path program 1 times [2024-11-07 11:01:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727980558] [2024-11-07 11:01:46,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727980558] [2024-11-07 11:01:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727980558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:01:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897040627] [2024-11-07 11:01:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:01:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:01:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:01:47,050 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:47,097 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2024-11-07 11:01:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:01:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2024-11-07 11:01:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:47,100 INFO L225 Difference]: With dead ends: 213 [2024-11-07 11:01:47,100 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 11:01:47,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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 11:01:47,103 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 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 11:01:47,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:01:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 11:01:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 11:01:47,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-07 11:01:47,119 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2024-11-07 11:01:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:47,123 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-07 11:01:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-07 11:01:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 11:01:47,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:47,126 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:47,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:01:47,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:47,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1758725136, now seen corresponding path program 1 times [2024-11-07 11:01:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796717747] [2024-11-07 11:01:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:47,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796717747] [2024-11-07 11:01:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796717747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:47,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:47,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:01:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335945442] [2024-11-07 11:01:47,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:47,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:01:47,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:01:47,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:01:47,941 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:48,216 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-07 11:01:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:01:48,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-07 11:01:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:48,219 INFO L225 Difference]: With dead ends: 222 [2024-11-07 11:01:48,219 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 11:01:48,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:01:48,220 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 110 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:48,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 417 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 11:01:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 11:01:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-07 11:01:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-07 11:01:48,235 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 155 [2024-11-07 11:01:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:48,236 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-07 11:01:48,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-07 11:01:48,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 11:01:48,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:48,241 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:48,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:01:48,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1539870418, now seen corresponding path program 1 times [2024-11-07 11:01:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426671065] [2024-11-07 11:01:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426671065] [2024-11-07 11:01:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426671065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:48,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:01:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70740580] [2024-11-07 11:01:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:01:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:01:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:01:48,999 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:49,342 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2024-11-07 11:01:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:01:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-11-07 11:01:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:49,344 INFO L225 Difference]: With dead ends: 262 [2024-11-07 11:01:49,344 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 11:01:49,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:01:49,346 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 197 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:49,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 361 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:01:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 11:01:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2024-11-07 11:01:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-07 11:01:49,358 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 155 [2024-11-07 11:01:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:49,359 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-07 11:01:49,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-07 11:01:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 11:01:49,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:49,360 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:49,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:01:49,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:49,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1839204390, now seen corresponding path program 1 times [2024-11-07 11:01:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:49,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168731829] [2024-11-07 11:01:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168731829] [2024-11-07 11:01:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168731829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 11:01:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687066737] [2024-11-07 11:01:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:51,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:01:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:51,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:01:51,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:01:51,216 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 11:01:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:51,924 INFO L93 Difference]: Finished difference Result 290 states and 410 transitions. [2024-11-07 11:01:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 11:01:51,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2024-11-07 11:01:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:51,925 INFO L225 Difference]: With dead ends: 290 [2024-11-07 11:01:51,925 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 11:01:51,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-07 11:01:51,926 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 419 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:51,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 409 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 11:01:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 11:01:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 137. [2024-11-07 11:01:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2024-11-07 11:01:51,940 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 156 [2024-11-07 11:01:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:51,941 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2024-11-07 11:01:51,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-07 11:01:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2024-11-07 11:01:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 11:01:51,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:51,945 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:01:51,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:51,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1868956892, now seen corresponding path program 1 times [2024-11-07 11:01:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241506941] [2024-11-07 11:01:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241506941] [2024-11-07 11:01:53,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241506941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:53,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:53,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 11:01:53,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997803512] [2024-11-07 11:01:53,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:53,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 11:01:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 11:01:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:01:53,366 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:53,936 INFO L93 Difference]: Finished difference Result 401 states and 563 transitions. [2024-11-07 11:01:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 11:01:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-07 11:01:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:53,942 INFO L225 Difference]: With dead ends: 401 [2024-11-07 11:01:53,942 INFO L226 Difference]: Without dead ends: 267 [2024-11-07 11:01:53,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-07 11:01:53,944 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 292 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:53,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-07 11:01:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 156. [2024-11-07 11:01:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2024-11-07 11:01:53,963 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 156 [2024-11-07 11:01:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:53,964 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2024-11-07 11:01:53,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:01:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2024-11-07 11:01:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 11:01:53,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:53,966 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:53,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:01:53,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:53,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1084467217, now seen corresponding path program 1 times [2024-11-07 11:01:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:53,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434250353] [2024-11-07 11:01:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:55,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434250353] [2024-11-07 11:01:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434250353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 11:01:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665168762] [2024-11-07 11:01:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:01:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:01:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:01:55,372 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 11:01:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:55,957 INFO L93 Difference]: Finished difference Result 369 states and 519 transitions. [2024-11-07 11:01:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 11:01:55,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-07 11:01:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:55,960 INFO L225 Difference]: With dead ends: 369 [2024-11-07 11:01:55,960 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 11:01:55,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-07 11:01:55,961 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 702 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:55,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 329 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:01:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 11:01:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 171. [2024-11-07 11:01:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.348993288590604) internal successors, (201), 149 states have internal predecessors, (201), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2024-11-07 11:01:55,977 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 157 [2024-11-07 11:01:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:55,977 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2024-11-07 11:01:55,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 11:01:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2024-11-07 11:01:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 11:01:55,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:55,978 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:55,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:01:55,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:55,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1671273231, now seen corresponding path program 1 times [2024-11-07 11:01:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:55,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75818079] [2024-11-07 11:01:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:01:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:01:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:01:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:01:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:01:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:01:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:01:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:01:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:01:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:01:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:01:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:01:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:01:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:01:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:01:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:01:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:01:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:01:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:01:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:01:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:01:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:01:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:01:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75818079] [2024-11-07 11:01:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75818079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:01:58,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:01:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 11:01:58,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901883003] [2024-11-07 11:01:58,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:01:58,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:01:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:01:58,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:01:58,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:01:58,250 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 11:01:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:01:59,749 INFO L93 Difference]: Finished difference Result 416 states and 583 transitions. [2024-11-07 11:01:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 11:01:59,750 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-07 11:01:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:01:59,752 INFO L225 Difference]: With dead ends: 416 [2024-11-07 11:01:59,752 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 11:01:59,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-07 11:01:59,754 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 390 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 11:01:59,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 793 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 11:01:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 11:01:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 144. [2024-11-07 11:01:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 122 states have internal predecessors, (163), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 11:01:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2024-11-07 11:01:59,769 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 157 [2024-11-07 11:01:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:01:59,770 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2024-11-07 11:01:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 11:01:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2024-11-07 11:01:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 11:01:59,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:01:59,771 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:01:59,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:01:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:01:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1149188459, now seen corresponding path program 1 times [2024-11-07 11:01:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:01:59,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147664345] [2024-11-07 11:01:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:01:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:01:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:02:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:03,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147664345] [2024-11-07 11:02:03,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147664345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:03,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:03,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-07 11:02:03,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121685838] [2024-11-07 11:02:03,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:03,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 11:02:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 11:02:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-07 11:02:03,411 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-07 11:02:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:06,710 INFO L93 Difference]: Finished difference Result 606 states and 850 transitions. [2024-11-07 11:02:06,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 11:02:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 157 [2024-11-07 11:02:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:06,712 INFO L225 Difference]: With dead ends: 606 [2024-11-07 11:02:06,712 INFO L226 Difference]: Without dead ends: 465 [2024-11-07 11:02:06,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=370, Invalid=1700, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 11:02:06,715 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1181 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:06,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1181 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 11:02:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-07 11:02:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 218. [2024-11-07 11:02:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 175 states have internal predecessors, (229), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 11:02:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2024-11-07 11:02:06,742 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 157 [2024-11-07 11:02:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:06,742 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2024-11-07 11:02:06,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-07 11:02:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2024-11-07 11:02:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 11:02:06,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:06,746 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 11:02:06,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash 138071209, now seen corresponding path program 1 times [2024-11-07 11:02:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:06,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614373099] [2024-11-07 11:02:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:02:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614373099] [2024-11-07 11:02:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614373099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:07,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 11:02:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161846409] [2024-11-07 11:02:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:07,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 11:02:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 11:02:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 11:02:07,137 INFO L87 Difference]: Start difference. First operand 218 states and 309 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:02:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:07,434 INFO L93 Difference]: Finished difference Result 401 states and 567 transitions. [2024-11-07 11:02:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:02:07,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-11-07 11:02:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:07,436 INFO L225 Difference]: With dead ends: 401 [2024-11-07 11:02:07,436 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 11:02:07,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:02:07,438 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 207 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:07,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 438 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 11:02:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 11:02:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2024-11-07 11:02:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 179 states have internal predecessors, (233), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 11:02:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 313 transitions. [2024-11-07 11:02:07,469 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 313 transitions. Word has length 157 [2024-11-07 11:02:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:07,469 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 313 transitions. [2024-11-07 11:02:07,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 11:02:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 313 transitions. [2024-11-07 11:02:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 11:02:07,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:07,473 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:07,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 11:02:07,474 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:07,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -844956247, now seen corresponding path program 1 times [2024-11-07 11:02:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:07,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446934302] [2024-11-07 11:02:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 11:02:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446934302] [2024-11-07 11:02:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446934302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:09,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 11:02:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696868239] [2024-11-07 11:02:09,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:09,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:02:09,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:02:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:02:09,254 INFO L87 Difference]: Start difference. First operand 222 states and 313 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 11:02:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:09,801 INFO L93 Difference]: Finished difference Result 405 states and 570 transitions. [2024-11-07 11:02:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:02:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-11-07 11:02:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:09,803 INFO L225 Difference]: With dead ends: 405 [2024-11-07 11:02:09,803 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 11:02:09,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 11:02:09,805 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 357 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:09,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 417 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:02:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 11:02:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2024-11-07 11:02:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.2960893854748603) internal successors, (232), 179 states have internal predecessors, (232), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 11:02:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 312 transitions. [2024-11-07 11:02:09,832 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 312 transitions. Word has length 157 [2024-11-07 11:02:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:09,833 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 312 transitions. [2024-11-07 11:02:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-07 11:02:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 312 transitions. [2024-11-07 11:02:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 11:02:09,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:09,848 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:02:09,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 11:02:09,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1856073497, now seen corresponding path program 1 times [2024-11-07 11:02:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:09,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358094642] [2024-11-07 11:02:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 11:02:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 11:02:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 11:02:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 11:02:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 42 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 11:02:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:13,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358094642] [2024-11-07 11:02:13,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358094642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:02:13,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150823387] [2024-11-07 11:02:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:13,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:02:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:02:13,929 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 11:02:13,930 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 11:02:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:14,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-07 11:02:14,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:02:14,152 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 80 treesize of output 79 [2024-11-07 11:02:17,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 123 [2024-11-07 11:02:20,440 INFO L349 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2024-11-07 11:02:20,440 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 3 case distinctions, treesize of input 25 treesize of output 47 [2024-11-07 11:02:44,698 INFO L349 Elim1Store]: treesize reduction 400, result has 77.7 percent of original size [2024-11-07 11:02:44,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 136 case distinctions, treesize of input 174 treesize of output 1498