./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df'] 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-4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:55:36,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:55:36,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:55:36,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:55:36,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:55:36,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:55:36,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:55:36,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:55:36,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:55:36,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:55:36,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:55:36,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:55:36,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:55:36,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:55:36,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:55:36,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:55:36,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:55:36,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:55:36,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:55:36,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:55:36,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:55:36,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:55:36,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:55:36,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:55:36,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:55:36,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:55:36,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:55:36,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:55:36,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:55:36,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:55:36,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:55:36,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:55:36,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:55:36,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:55:36,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:55:36,291 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 -> 4714a0c6536056117a4ee0063fda0c81448928e693130365c60e5088462281df [2024-11-07 10:55:36,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:55:36,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:55:36,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:55:36,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:55:36,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:55:36,605 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-4.i [2024-11-07 10:55:37,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:55:38,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:55:38,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-4.i [2024-11-07 10:55:38,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44bafd075/c7fb6f2e39224050b175d0dde6661535/FLAGac2df3abf [2024-11-07 10:55:38,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44bafd075/c7fb6f2e39224050b175d0dde6661535 [2024-11-07 10:55:38,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:55:38,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:55:38,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:55:38,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:55:38,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:55:38,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:38,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1074cb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38, skipping insertion in model container [2024-11-07 10:55:38,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:38,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:55:38,701 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-4.i[916,929] [2024-11-07 10:55:38,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:55:38,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:55:38,805 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-4.i[916,929] [2024-11-07 10:55:38,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:55:38,899 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:55:38,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38 WrapperNode [2024-11-07 10:55:38,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:55:38,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:55:38,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:55:38,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:55:38,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:38,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:38,984 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-11-07 10:55:38,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:55:38,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:55:38,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:55:38,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:55:38,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:38,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,018 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:55:39,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:55:39,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:55:39,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:55:39,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:55:39,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (1/1) ... [2024-11-07 10:55:39,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:55:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:55:39,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:55:39,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:55:39,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:55:39,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:55:39,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:55:39,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:55:39,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:55:39,272 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:55:39,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:55:39,865 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-07 10:55:39,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:55:39,881 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:55:39,882 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:55:39,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:55:39 BoogieIcfgContainer [2024-11-07 10:55:39,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:55:39,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:55:39,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:55:39,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:55:39,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:55:38" (1/3) ... [2024-11-07 10:55:39,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb3bc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:55:39, skipping insertion in model container [2024-11-07 10:55:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:55:38" (2/3) ... [2024-11-07 10:55:39,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb3bc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:55:39, skipping insertion in model container [2024-11-07 10:55:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:55:39" (3/3) ... [2024-11-07 10:55:39,893 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-4.i [2024-11-07 10:55:39,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:55:39,907 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:55:39,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:55:39,980 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;@c11aea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:55:39,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:55:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:55:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 10:55:39,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:39,997 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:39,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash -81952660, now seen corresponding path program 1 times [2024-11-07 10:55:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:40,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979869354] [2024-11-07 10:55:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979869354] [2024-11-07 10:55:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979869354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:55:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850283888] [2024-11-07 10:55:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:40,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:55:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:55:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:55:40,847 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.423913043478261) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:40,902 INFO L93 Difference]: Finished difference Result 216 states and 335 transitions. [2024-11-07 10:55:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:55:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-07 10:55:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:40,910 INFO L225 Difference]: With dead ends: 216 [2024-11-07 10:55:40,911 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 10:55:40,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:55:40,915 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:40,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 10:55:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-07 10:55:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:55:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-07 10:55:40,951 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2024-11-07 10:55:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:40,952 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-07 10:55:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-07 10:55:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 10:55:40,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:40,956 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:40,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:55:40,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:40,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash -80105618, now seen corresponding path program 1 times [2024-11-07 10:55:40,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:40,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337622454] [2024-11-07 10:55:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337622454] [2024-11-07 10:55:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337622454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:42,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:55:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690982119] [2024-11-07 10:55:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:42,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:55:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:55:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:55:42,533 INFO L87 Difference]: Start difference. First operand 108 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:43,009 INFO L93 Difference]: Finished difference Result 250 states and 360 transitions. [2024-11-07 10:55:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:55:43,010 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-07 10:55:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:43,012 INFO L225 Difference]: With dead ends: 250 [2024-11-07 10:55:43,012 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 10:55:43,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:55:43,014 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 195 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:43,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 447 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:55:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 10:55:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2024-11-07 10:55:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:55:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2024-11-07 10:55:43,035 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 130 [2024-11-07 10:55:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:43,035 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2024-11-07 10:55:43,035 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2024-11-07 10:55:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 10:55:43,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:43,037 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:55:43,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:43,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash 620958960, now seen corresponding path program 1 times [2024-11-07 10:55:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156878723] [2024-11-07 10:55:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156878723] [2024-11-07 10:55:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156878723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:55:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154504494] [2024-11-07 10:55:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:55:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:55:43,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:55:43,313 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:43,345 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2024-11-07 10:55:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:55:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-11-07 10:55:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:43,348 INFO L225 Difference]: With dead ends: 237 [2024-11-07 10:55:43,349 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 10:55:43,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:55:43,351 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:43,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 10:55:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-07 10:55:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:55:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2024-11-07 10:55:43,372 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 130 [2024-11-07 10:55:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:43,375 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2024-11-07 10:55:43,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2024-11-07 10:55:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 10:55:43,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:43,377 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:55:43,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:43,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1471545218, now seen corresponding path program 1 times [2024-11-07 10:55:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180223626] [2024-11-07 10:55:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180223626] [2024-11-07 10:55:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180223626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:55:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567213632] [2024-11-07 10:55:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:55:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:55:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:55:43,665 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:43,703 INFO L93 Difference]: Finished difference Result 247 states and 353 transitions. [2024-11-07 10:55:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:55:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-07 10:55:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:43,707 INFO L225 Difference]: With dead ends: 247 [2024-11-07 10:55:43,708 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 10:55:43,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:55:43,710 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:43,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:55:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 10:55:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2024-11-07 10:55:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:55:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-07 10:55:43,720 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 132 [2024-11-07 10:55:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:43,721 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-07 10:55:43,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:55:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-07 10:55:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:55:43,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:43,722 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:43,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:55:43,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1138408969, now seen corresponding path program 1 times [2024-11-07 10:55:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537749380] [2024-11-07 10:55:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537749380] [2024-11-07 10:55:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537749380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:47,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:55:47,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025715749] [2024-11-07 10:55:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:47,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:55:47,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:47,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:55:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:55:47,199 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:55:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:48,902 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2024-11-07 10:55:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:55:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2024-11-07 10:55:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:48,905 INFO L225 Difference]: With dead ends: 298 [2024-11-07 10:55:48,905 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 10:55:48,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:55:48,906 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 380 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:48,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 569 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:55:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 10:55:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2024-11-07 10:55:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 10:55:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2024-11-07 10:55:48,934 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 133 [2024-11-07 10:55:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:48,935 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2024-11-07 10:55:48,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:55:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2024-11-07 10:55:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:55:48,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:48,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:48,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:55:48,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:48,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2135489973, now seen corresponding path program 1 times [2024-11-07 10:55:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890514988] [2024-11-07 10:55:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890514988] [2024-11-07 10:55:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890514988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:55:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106294107] [2024-11-07 10:55:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:52,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:55:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:55:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:55:52,050 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:55:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:53,780 INFO L93 Difference]: Finished difference Result 362 states and 507 transitions. [2024-11-07 10:55:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:55:53,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2024-11-07 10:55:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:53,784 INFO L225 Difference]: With dead ends: 362 [2024-11-07 10:55:53,784 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 10:55:53,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:55:53,788 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 467 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:53,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 633 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:55:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 10:55:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 186. [2024-11-07 10:55:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 164 states have internal predecessors, (221), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:55:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 261 transitions. [2024-11-07 10:55:53,822 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 261 transitions. Word has length 133 [2024-11-07 10:55:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:53,823 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 261 transitions. [2024-11-07 10:55:53,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:55:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 261 transitions. [2024-11-07 10:55:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:55:53,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:53,824 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:53,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:55:53,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:53,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1272422475, now seen corresponding path program 1 times [2024-11-07 10:55:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592786059] [2024-11-07 10:55:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:55,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592786059] [2024-11-07 10:55:55,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592786059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:55,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:55:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768276755] [2024-11-07 10:55:55,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:55:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:55,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:55:55,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:55:55,894 INFO L87 Difference]: Start difference. First operand 186 states and 261 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:55:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:55:57,543 INFO L93 Difference]: Finished difference Result 421 states and 590 transitions. [2024-11-07 10:55:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:55:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2024-11-07 10:55:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:55:57,548 INFO L225 Difference]: With dead ends: 421 [2024-11-07 10:55:57,548 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 10:55:57,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:55:57,550 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 305 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:55:57,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 656 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:55:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 10:55:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2024-11-07 10:55:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.3662790697674418) internal successors, (235), 173 states have internal predecessors, (235), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:55:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 275 transitions. [2024-11-07 10:55:57,575 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 275 transitions. Word has length 133 [2024-11-07 10:55:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:55:57,575 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 275 transitions. [2024-11-07 10:55:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:55:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 275 transitions. [2024-11-07 10:55:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:55:57,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:55:57,578 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:55:57,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:55:57,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:55:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:55:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2001476467, now seen corresponding path program 1 times [2024-11-07 10:55:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:55:57,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485086165] [2024-11-07 10:55:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:55:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:55:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:55:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:55:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:55:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:55:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:55:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:55:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:55:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:55:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:55:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:55:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:55:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:55:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:55:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:55:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:55:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:55:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:55:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:55:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485086165] [2024-11-07 10:55:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485086165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:55:59,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:55:59,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:55:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668219042] [2024-11-07 10:55:59,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:59,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:55:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:55:59,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:55:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:55:59,733 INFO L87 Difference]: Start difference. First operand 195 states and 275 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:00,514 INFO L93 Difference]: Finished difference Result 391 states and 552 transitions. [2024-11-07 10:56:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:56:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2024-11-07 10:56:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:00,518 INFO L225 Difference]: With dead ends: 391 [2024-11-07 10:56:00,519 INFO L226 Difference]: Without dead ends: 199 [2024-11-07 10:56:00,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:56:00,521 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 210 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:00,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 392 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:56:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-07 10:56:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2024-11-07 10:56:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.371069182389937) internal successors, (218), 160 states have internal predecessors, (218), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:56:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 258 transitions. [2024-11-07 10:56:00,542 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 258 transitions. Word has length 133 [2024-11-07 10:56:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:00,542 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 258 transitions. [2024-11-07 10:56:00,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 258 transitions. [2024-11-07 10:56:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:00,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:00,545 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:56:00,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -967344249, now seen corresponding path program 1 times [2024-11-07 10:56:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056297643] [2024-11-07 10:56:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:02,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:02,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056297643] [2024-11-07 10:56:02,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056297643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:02,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:02,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:56:02,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066503678] [2024-11-07 10:56:02,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:02,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:56:02,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:56:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:56:02,590 INFO L87 Difference]: Start difference. First operand 182 states and 258 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:03,857 INFO L93 Difference]: Finished difference Result 367 states and 518 transitions. [2024-11-07 10:56:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:56:03,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-07 10:56:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:03,861 INFO L225 Difference]: With dead ends: 367 [2024-11-07 10:56:03,861 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:56:03,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:56:03,862 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 361 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:03,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 516 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:56:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:56:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2024-11-07 10:56:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 159 states have (on average 1.3647798742138364) internal successors, (217), 160 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:56:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 257 transitions. [2024-11-07 10:56:03,881 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 257 transitions. Word has length 134 [2024-11-07 10:56:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 257 transitions. [2024-11-07 10:56:03,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 257 transitions. [2024-11-07 10:56:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:03,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:03,883 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:56:03,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:03,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2047759369, now seen corresponding path program 1 times [2024-11-07 10:56:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076051842] [2024-11-07 10:56:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076051842] [2024-11-07 10:56:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076051842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:04,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:04,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:56:04,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103897689] [2024-11-07 10:56:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:56:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:56:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:56:04,680 INFO L87 Difference]: Start difference. First operand 182 states and 257 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:56:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:05,110 INFO L93 Difference]: Finished difference Result 421 states and 590 transitions. [2024-11-07 10:56:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:56:05,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-07 10:56:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:05,114 INFO L225 Difference]: With dead ends: 421 [2024-11-07 10:56:05,114 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 10:56:05,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:56:05,115 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:05,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 429 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:56:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 10:56:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 186. [2024-11-07 10:56:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 164 states have internal predecessors, (221), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:56:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 261 transitions. [2024-11-07 10:56:05,137 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 261 transitions. Word has length 134 [2024-11-07 10:56:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:05,137 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 261 transitions. [2024-11-07 10:56:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 10:56:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 261 transitions. [2024-11-07 10:56:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:05,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:05,139 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:05,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:56:05,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:05,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1267807044, now seen corresponding path program 1 times [2024-11-07 10:56:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:05,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887895376] [2024-11-07 10:56:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887895376] [2024-11-07 10:56:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887895376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:09,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:09,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:56:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536698849] [2024-11-07 10:56:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:56:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:56:09,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:56:09,963 INFO L87 Difference]: Start difference. First operand 186 states and 261 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:13,142 INFO L93 Difference]: Finished difference Result 620 states and 864 transitions. [2024-11-07 10:56:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:56:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-07 10:56:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:13,145 INFO L225 Difference]: With dead ends: 620 [2024-11-07 10:56:13,145 INFO L226 Difference]: Without dead ends: 437 [2024-11-07 10:56:13,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:56:13,147 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 335 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:13,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 795 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 10:56:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-07 10:56:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 303. [2024-11-07 10:56:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 263 states have (on average 1.3460076045627376) internal successors, (354), 264 states have internal predecessors, (354), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 10:56:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 424 transitions. [2024-11-07 10:56:13,184 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 424 transitions. Word has length 134 [2024-11-07 10:56:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:13,184 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 424 transitions. [2024-11-07 10:56:13,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 424 transitions. [2024-11-07 10:56:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:13,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:13,187 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:13,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:56:13,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:13,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1668236923, now seen corresponding path program 1 times [2024-11-07 10:56:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893553896] [2024-11-07 10:56:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:15,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:15,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893553896] [2024-11-07 10:56:15,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893553896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:15,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:15,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 10:56:15,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946268949] [2024-11-07 10:56:15,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:15,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 10:56:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:15,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 10:56:15,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:56:15,678 INFO L87 Difference]: Start difference. First operand 303 states and 424 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:16,941 INFO L93 Difference]: Finished difference Result 494 states and 690 transitions. [2024-11-07 10:56:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:56:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-07 10:56:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:16,944 INFO L225 Difference]: With dead ends: 494 [2024-11-07 10:56:16,944 INFO L226 Difference]: Without dead ends: 311 [2024-11-07 10:56:16,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:56:16,946 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 281 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:16,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 689 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:56:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-07 10:56:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2024-11-07 10:56:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 268 states have internal predecessors, (358), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 10:56:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 428 transitions. [2024-11-07 10:56:16,987 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 428 transitions. Word has length 134 [2024-11-07 10:56:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:16,987 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 428 transitions. [2024-11-07 10:56:16,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 428 transitions. [2024-11-07 10:56:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:16,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:16,989 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:16,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:56:16,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:16,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash -967172345, now seen corresponding path program 1 times [2024-11-07 10:56:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:16,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234630693] [2024-11-07 10:56:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234630693] [2024-11-07 10:56:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234630693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:56:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167048711] [2024-11-07 10:56:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:19,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:56:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:56:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:56:19,513 INFO L87 Difference]: Start difference. First operand 307 states and 428 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:20,738 INFO L93 Difference]: Finished difference Result 501 states and 695 transitions. [2024-11-07 10:56:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:56:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-07 10:56:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:20,743 INFO L225 Difference]: With dead ends: 501 [2024-11-07 10:56:20,744 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 10:56:20,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:56:20,746 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 348 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:20,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 553 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:56:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 10:56:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2024-11-07 10:56:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 269 states have (on average 1.3345724907063197) internal successors, (359), 270 states have internal predecessors, (359), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 10:56:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2024-11-07 10:56:20,793 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 134 [2024-11-07 10:56:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:20,793 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2024-11-07 10:56:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2024-11-07 10:56:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:20,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:20,796 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:20,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:56:20,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:20,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1527688313, now seen corresponding path program 1 times [2024-11-07 10:56:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:20,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446717046] [2024-11-07 10:56:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:24,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446717046] [2024-11-07 10:56:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446717046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:24,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:56:24,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849692704] [2024-11-07 10:56:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:24,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:56:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:56:24,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:56:24,071 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-07 10:56:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:25,075 INFO L93 Difference]: Finished difference Result 558 states and 764 transitions. [2024-11-07 10:56:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:56:25,076 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) Word has length 134 [2024-11-07 10:56:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:25,079 INFO L225 Difference]: With dead ends: 558 [2024-11-07 10:56:25,080 INFO L226 Difference]: Without dead ends: 368 [2024-11-07 10:56:25,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:56:25,081 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 454 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:25,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 512 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:56:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-07 10:56:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 363. [2024-11-07 10:56:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 317 states have (on average 1.3249211356466877) internal successors, (420), 319 states have internal predecessors, (420), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:56:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 496 transitions. [2024-11-07 10:56:25,126 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 496 transitions. Word has length 134 [2024-11-07 10:56:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:25,127 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 496 transitions. [2024-11-07 10:56:25,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.166666666666667) internal successors, (62), 14 states have internal predecessors, (62), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 4 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-07 10:56:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 496 transitions. [2024-11-07 10:56:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:25,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:25,128 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:25,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:56:25,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:25,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash -826623735, now seen corresponding path program 1 times [2024-11-07 10:56:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693590766] [2024-11-07 10:56:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:25,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693590766] [2024-11-07 10:56:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693590766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:26,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 10:56:26,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375988890] [2024-11-07 10:56:26,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:26,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:56:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:26,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:56:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:56:26,943 INFO L87 Difference]: Start difference. First operand 363 states and 496 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:28,251 INFO L93 Difference]: Finished difference Result 609 states and 830 transitions. [2024-11-07 10:56:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:56:28,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2024-11-07 10:56:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:28,254 INFO L225 Difference]: With dead ends: 609 [2024-11-07 10:56:28,254 INFO L226 Difference]: Without dead ends: 370 [2024-11-07 10:56:28,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:56:28,256 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 316 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:28,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1018 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:56:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-07 10:56:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2024-11-07 10:56:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 320 states have (on average 1.321875) internal successors, (423), 322 states have internal predecessors, (423), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:56:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 499 transitions. [2024-11-07 10:56:28,298 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 499 transitions. Word has length 134 [2024-11-07 10:56:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:28,299 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 499 transitions. [2024-11-07 10:56:28,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 10:56:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 499 transitions. [2024-11-07 10:56:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:28,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:28,300 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:56:28,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1328811445, now seen corresponding path program 1 times [2024-11-07 10:56:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767936505] [2024-11-07 10:56:28,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767936505] [2024-11-07 10:56:30,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767936505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:30,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:30,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:56:30,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431355221] [2024-11-07 10:56:30,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:30,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:56:30,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:30,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:56:30,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:56:30,684 INFO L87 Difference]: Start difference. First operand 366 states and 499 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:31,685 INFO L93 Difference]: Finished difference Result 671 states and 913 transitions. [2024-11-07 10:56:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:56:31,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-07 10:56:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:31,689 INFO L225 Difference]: With dead ends: 671 [2024-11-07 10:56:31,689 INFO L226 Difference]: Without dead ends: 429 [2024-11-07 10:56:31,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:56:31,690 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 340 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:31,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 562 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:56:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-07 10:56:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 396. [2024-11-07 10:56:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 350 states have (on average 1.3285714285714285) internal successors, (465), 352 states have internal predecessors, (465), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:56:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 541 transitions. [2024-11-07 10:56:31,744 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 541 transitions. Word has length 134 [2024-11-07 10:56:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:31,744 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 541 transitions. [2024-11-07 10:56:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 541 transitions. [2024-11-07 10:56:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:31,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:31,746 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:31,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:56:31,746 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2029876023, now seen corresponding path program 1 times [2024-11-07 10:56:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:31,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926869244] [2024-11-07 10:56:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:33,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926869244] [2024-11-07 10:56:33,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926869244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:33,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:33,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 10:56:33,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040237980] [2024-11-07 10:56:33,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:33,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:56:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:33,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:56:33,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:56:33,852 INFO L87 Difference]: Start difference. First operand 396 states and 541 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:35,076 INFO L93 Difference]: Finished difference Result 694 states and 946 transitions. [2024-11-07 10:56:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:56:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-07 10:56:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:35,078 INFO L225 Difference]: With dead ends: 694 [2024-11-07 10:56:35,078 INFO L226 Difference]: Without dead ends: 422 [2024-11-07 10:56:35,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:56:35,080 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 292 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:35,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 929 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:56:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-07 10:56:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 397. [2024-11-07 10:56:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 351 states have (on average 1.3276353276353277) internal successors, (466), 353 states have internal predecessors, (466), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:56:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 542 transitions. [2024-11-07 10:56:35,122 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 542 transitions. Word has length 134 [2024-11-07 10:56:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:35,122 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 542 transitions. [2024-11-07 10:56:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 542 transitions. [2024-11-07 10:56:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:35,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:35,123 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:35,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:56:35,124 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:35,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 928381566, now seen corresponding path program 1 times [2024-11-07 10:56:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457408643] [2024-11-07 10:56:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:56:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:56:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:56:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:56:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:56:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:56:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:56:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:56:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:56:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:56:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:56:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:56:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:56:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:56:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:56:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:56:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 10:56:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:56:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457408643] [2024-11-07 10:56:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457408643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:56:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:56:37,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:56:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111167233] [2024-11-07 10:56:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:56:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:56:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:56:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:56:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:56:37,759 INFO L87 Difference]: Start difference. First operand 397 states and 542 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:56:38,703 INFO L93 Difference]: Finished difference Result 705 states and 958 transitions. [2024-11-07 10:56:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:56:38,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) Word has length 134 [2024-11-07 10:56:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:56:38,706 INFO L225 Difference]: With dead ends: 705 [2024-11-07 10:56:38,706 INFO L226 Difference]: Without dead ends: 432 [2024-11-07 10:56:38,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:56:38,708 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 242 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:56:38,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 507 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:56:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-07 10:56:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 397. [2024-11-07 10:56:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 351 states have (on average 1.3247863247863247) internal successors, (465), 353 states have internal predecessors, (465), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 10:56:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 541 transitions. [2024-11-07 10:56:38,760 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 541 transitions. Word has length 134 [2024-11-07 10:56:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:56:38,760 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 541 transitions. [2024-11-07 10:56:38,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-07 10:56:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 541 transitions. [2024-11-07 10:56:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:56:38,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:56:38,762 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:56:38,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:56:38,762 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:56:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:56:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1629446144, now seen corresponding path program 1 times [2024-11-07 10:56:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:56:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299790730] [2024-11-07 10:56:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:56:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:56:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat