./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.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', '5326c7e78fc5e18ed4f8f1ba81fdcfea4ce5d46591384cd6b4be08f47f5245c7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.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 5326c7e78fc5e18ed4f8f1ba81fdcfea4ce5d46591384cd6b4be08f47f5245c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:57:46,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:57:46,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:57:46,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:57:46,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:57:46,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:57:46,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:57:46,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:57:46,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:57:46,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:57:46,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:57:46,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:57:46,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:57:46,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:57:46,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:57:46,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:57:46,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:57:46,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:57:46,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:57:46,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:57:46,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:57:46,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:57:46,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:57:46,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:57:46,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:57:46,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:57:46,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:57:46,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:57:46,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:57:46,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:57:46,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:57:46,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:57:46,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:57:46,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:57:46,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:57:46,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:57:46,799 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 -> 5326c7e78fc5e18ed4f8f1ba81fdcfea4ce5d46591384cd6b4be08f47f5245c7 [2024-11-07 05:57:47,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:57:47,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:57:47,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:57:47,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:57:47,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:57:47,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.i [2024-11-07 05:57:48,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:57:48,698 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:57:48,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.i [2024-11-07 05:57:48,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/062cc2c9b/ea9b40c6a85d4ce8b51d5e8d1cc759cb/FLAG4fbb6104a [2024-11-07 05:57:48,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/062cc2c9b/ea9b40c6a85d4ce8b51d5e8d1cc759cb [2024-11-07 05:57:48,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:57:48,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:57:48,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:57:48,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:57:48,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:57:48,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:57:48" (1/1) ... [2024-11-07 05:57:48,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d80943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:48, skipping insertion in model container [2024-11-07 05:57:48,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:57:48" (1/1) ... [2024-11-07 05:57:48,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:57:48,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.i[919,932] [2024-11-07 05:57:48,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:57:49,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:57:49,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.i[919,932] [2024-11-07 05:57:49,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:57:49,092 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:57:49,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49 WrapperNode [2024-11-07 05:57:49,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:57:49,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:57:49,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:57:49,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:57:49,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,166 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-07 05:57:49,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:57:49,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:57:49,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:57:49,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:57:49,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,212 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:57:49,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:57:49,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:57:49,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:57:49,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:57:49,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (1/1) ... [2024-11-07 05:57:49,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:57:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:57:49,271 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 05:57:49,275 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 05:57:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:57:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:57:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:57:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:57:49,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:57:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:57:49,403 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:57:49,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:57:49,870 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 05:57:49,871 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:57:49,881 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:57:49,882 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:57:49,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:57:49 BoogieIcfgContainer [2024-11-07 05:57:49,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:57:49,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:57:49,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:57:49,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:57:49,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:57:48" (1/3) ... [2024-11-07 05:57:49,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1cc648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:57:49, skipping insertion in model container [2024-11-07 05:57:49,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:57:49" (2/3) ... [2024-11-07 05:57:49,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1cc648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:57:49, skipping insertion in model container [2024-11-07 05:57:49,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:57:49" (3/3) ... [2024-11-07 05:57:49,891 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-45.i [2024-11-07 05:57:49,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:57:49,906 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:57:49,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:57:49,973 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;@466fa614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:57:49,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:57:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 63 states have (on average 1.380952380952381) internal successors, (87), 64 states have internal predecessors, (87), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 05:57:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 05:57:49,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:57:49,993 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:49,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:57:49,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:57:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1376965240, now seen corresponding path program 1 times [2024-11-07 05:57:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:57:50,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632840080] [2024-11-07 05:57:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:57:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:57:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:57:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:57:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:57:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:57:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:57:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:57:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:57:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:57:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:57:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:57:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:57:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:57:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:57:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:57:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:57:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:57:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:57:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:57:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:57:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:57:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:57:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:57:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:57:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:57:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:57:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:57:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:57:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:57:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:57:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:57:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:57:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:57:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:57:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:57:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:57:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:57:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:57:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:57:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:57:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:57:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:57:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 05:57:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:57:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632840080] [2024-11-07 05:57:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632840080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:57:50,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:57:50,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:57:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424456999] [2024-11-07 05:57:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:57:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:57:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:57:50,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:57:50,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:57:50,732 INFO L87 Difference]: Start difference. First operand has 107 states, 63 states have (on average 1.380952380952381) internal successors, (87), 64 states have internal predecessors, (87), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 05:57:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:57:50,766 INFO L93 Difference]: Finished difference Result 207 states and 373 transitions. [2024-11-07 05:57:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:57:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 255 [2024-11-07 05:57:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:57:50,777 INFO L225 Difference]: With dead ends: 207 [2024-11-07 05:57:50,777 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 05:57:50,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:57:50,784 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:57:50,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:57:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 05:57:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-07 05:57:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 05:57:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 162 transitions. [2024-11-07 05:57:50,854 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 162 transitions. Word has length 255 [2024-11-07 05:57:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:57:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 162 transitions. [2024-11-07 05:57:50,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 05:57:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 162 transitions. [2024-11-07 05:57:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 05:57:50,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:57:50,865 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:50,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:57:50,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:57:50,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:57:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 524619282, now seen corresponding path program 1 times [2024-11-07 05:57:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:57:50,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500080114] [2024-11-07 05:57:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:57:50,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:57:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:57:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:57:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:57:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:57:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:57:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:57:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:57:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:57:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:57:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:57:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:57:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:57:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:57:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:57:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:57:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:57:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:57:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:57:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:57:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:57:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:57:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:57:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:57:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:57:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:57:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:57:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:57:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:57:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:57:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:57:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:57:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:57:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:57:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:57:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:57:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:57:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:57:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:57:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:57:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:57:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:57:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 05:57:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:57:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500080114] [2024-11-07 05:57:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500080114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:57:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:57:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:57:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135392549] [2024-11-07 05:57:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:57:51,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:57:51,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:57:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:57:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:57:51,442 INFO L87 Difference]: Start difference. First operand 103 states and 162 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:57:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:57:51,538 INFO L93 Difference]: Finished difference Result 300 states and 474 transitions. [2024-11-07 05:57:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:57:51,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 255 [2024-11-07 05:57:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:57:51,546 INFO L225 Difference]: With dead ends: 300 [2024-11-07 05:57:51,546 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 05:57:51,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:57:51,549 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:57:51,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:57:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 05:57:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-11-07 05:57:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 113 states have internal predecessors, (147), 82 states have call successors, (82), 2 states have call predecessors, (82), 2 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 05:57:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 311 transitions. [2024-11-07 05:57:51,590 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 311 transitions. Word has length 255 [2024-11-07 05:57:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:57:51,591 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 311 transitions. [2024-11-07 05:57:51,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:57:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 311 transitions. [2024-11-07 05:57:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:57:51,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:57:51,596 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:57:51,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:57:51,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:57:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 183277110, now seen corresponding path program 1 times [2024-11-07 05:57:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:57:51,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88521054] [2024-11-07 05:57:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:57:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:57:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:57:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:57:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:57:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:57:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:57:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:57:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:57:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:57:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:57:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:57:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:57:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:57:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:57:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:57:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:57:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:57:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:57:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:57:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:57:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:57:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:57:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:57:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:57:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:57:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:57:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:57:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:57:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:57:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:57:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:57:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:57:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:57:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:57:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:57:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:57:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:57:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:57:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:57:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:57:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:57:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:57:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:57:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 05:57:52,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:57:52,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88521054] [2024-11-07 05:57:52,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88521054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:57:52,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:57:52,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:57:52,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481526267] [2024-11-07 05:57:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:57:52,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:57:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:57:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:57:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:57:52,011 INFO L87 Difference]: Start difference. First operand 198 states and 311 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:57:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:57:52,088 INFO L93 Difference]: Finished difference Result 477 states and 746 transitions. [2024-11-07 05:57:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:57:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 256 [2024-11-07 05:57:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:57:52,096 INFO L225 Difference]: With dead ends: 477 [2024-11-07 05:57:52,100 INFO L226 Difference]: Without dead ends: 282 [2024-11-07 05:57:52,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:57:52,103 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 67 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:57:52,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 321 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:57:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-07 05:57:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2024-11-07 05:57:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 161 states have internal predecessors, (205), 114 states have call successors, (114), 4 states have call predecessors, (114), 4 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-07 05:57:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 433 transitions. [2024-11-07 05:57:52,169 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 433 transitions. Word has length 256 [2024-11-07 05:57:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:57:52,170 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 433 transitions. [2024-11-07 05:57:52,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:57:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 433 transitions. [2024-11-07 05:57:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:57:52,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:57:52,174 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:52,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:57:52,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:57:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:57:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 441442548, now seen corresponding path program 1 times [2024-11-07 05:57:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:57:52,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553639075] [2024-11-07 05:57:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:57:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:57:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:58:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:58:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:58:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:58:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:58:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:58:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:58:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:58:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:58:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:58:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:58:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:58:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:58:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:58:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:58:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:58:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:58:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:58:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:58:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:58:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:58:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:58:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:58:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:58:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:58:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:58:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:58:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:58:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:58:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:58:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:58:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:58:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:58:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:58:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:58:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:58:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:58:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:58:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:58:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:58:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:58:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 05:58:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:58:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553639075] [2024-11-07 05:58:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553639075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:58:07,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:58:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:58:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147836525] [2024-11-07 05:58:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:58:07,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:58:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:58:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:58:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:58:07,603 INFO L87 Difference]: Start difference. First operand 278 states and 433 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:58:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:58:08,305 INFO L93 Difference]: Finished difference Result 830 states and 1272 transitions. [2024-11-07 05:58:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:58:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 256 [2024-11-07 05:58:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:58:08,313 INFO L225 Difference]: With dead ends: 830 [2024-11-07 05:58:08,314 INFO L226 Difference]: Without dead ends: 555 [2024-11-07 05:58:08,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:58:08,317 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 135 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:58:08,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 682 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:58:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-07 05:58:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 424. [2024-11-07 05:58:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 269 states have (on average 1.338289962825279) internal successors, (360), 275 states have internal predecessors, (360), 146 states have call successors, (146), 8 states have call predecessors, (146), 8 states have return successors, (146), 140 states have call predecessors, (146), 146 states have call successors, (146) [2024-11-07 05:58:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 652 transitions. [2024-11-07 05:58:08,418 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 652 transitions. Word has length 256 [2024-11-07 05:58:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:58:08,419 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 652 transitions. [2024-11-07 05:58:08,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:58:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 652 transitions. [2024-11-07 05:58:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:58:08,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:58:08,423 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:58:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:58:08,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:58:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:58:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -579625806, now seen corresponding path program 1 times [2024-11-07 05:58:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:58:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286361330] [2024-11-07 05:58:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:58:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:58:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:58:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:58:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:58:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:58:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:58:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:58:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:58:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:58:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:58:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:58:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:58:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:58:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:58:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:58:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:58:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:58:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:58:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:58:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:58:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:58:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:58:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:58:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:58:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:58:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:58:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:58:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:58:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:58:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:58:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:58:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:58:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:58:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:58:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:58:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:58:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:58:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:58:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:58:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:58:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:58:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:58:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 05:58:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:58:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286361330] [2024-11-07 05:58:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286361330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:58:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:58:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:58:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945618186] [2024-11-07 05:58:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:58:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:58:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:58:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:58:10,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:58:10,567 INFO L87 Difference]: Start difference. First operand 424 states and 652 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:58:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:58:10,991 INFO L93 Difference]: Finished difference Result 976 states and 1490 transitions. [2024-11-07 05:58:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:58:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 256 [2024-11-07 05:58:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:58:10,998 INFO L225 Difference]: With dead ends: 976 [2024-11-07 05:58:10,998 INFO L226 Difference]: Without dead ends: 555 [2024-11-07 05:58:11,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:58:11,002 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 154 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:58:11,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 548 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:58:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-07 05:58:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 419. [2024-11-07 05:58:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 264 states have (on average 1.3371212121212122) internal successors, (353), 270 states have internal predecessors, (353), 146 states have call successors, (146), 8 states have call predecessors, (146), 8 states have return successors, (146), 140 states have call predecessors, (146), 146 states have call successors, (146) [2024-11-07 05:58:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 645 transitions. [2024-11-07 05:58:11,083 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 645 transitions. Word has length 256 [2024-11-07 05:58:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:58:11,086 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 645 transitions. [2024-11-07 05:58:11,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:58:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 645 transitions. [2024-11-07 05:58:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:58:11,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:58:11,093 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:58:11,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:58:11,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:58:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:58:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2084302332, now seen corresponding path program 1 times [2024-11-07 05:58:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:58:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762121974] [2024-11-07 05:58:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:58:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:58:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:58:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:58:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:58:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:58:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:58:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:58:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:58:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:58:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:58:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:58:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:58:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:58:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:58:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:58:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:58:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:58:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:58:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:58:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:58:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:58:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:58:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:58:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:58:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:58:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:58:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:58:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:58:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 05:58:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-07 05:58:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:58:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:58:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:58:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 05:58:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:58:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-07 05:58:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 05:58:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 05:58:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-07 05:58:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 05:58:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-07 05:58:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-07 05:58:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:58:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-07 05:58:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:58:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762121974] [2024-11-07 05:58:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762121974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:58:11,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:58:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:58:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632935153] [2024-11-07 05:58:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:58:11,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:58:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:58:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:58:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:58:11,487 INFO L87 Difference]: Start difference. First operand 419 states and 645 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:58:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:58:11,612 INFO L93 Difference]: Finished difference Result 1251 states and 1929 transitions. [2024-11-07 05:58:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:58:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 256 [2024-11-07 05:58:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:58:11,621 INFO L225 Difference]: With dead ends: 1251 [2024-11-07 05:58:11,622 INFO L226 Difference]: Without dead ends: 835 [2024-11-07 05:58:11,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:58:11,625 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 72 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:58:11,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 314 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:58:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-07 05:58:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 829. [2024-11-07 05:58:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 520 states have (on average 1.3192307692307692) internal successors, (686), 532 states have internal predecessors, (686), 292 states have call successors, (292), 16 states have call predecessors, (292), 16 states have return successors, (292), 280 states have call predecessors, (292), 292 states have call successors, (292) [2024-11-07 05:58:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1270 transitions. [2024-11-07 05:58:11,787 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1270 transitions. Word has length 256 [2024-11-07 05:58:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:58:11,788 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1270 transitions. [2024-11-07 05:58:11,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2024-11-07 05:58:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1270 transitions. [2024-11-07 05:58:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 05:58:11,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:58:11,794 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:58:11,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:58:11,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:58:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:58:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2027044030, now seen corresponding path program 1 times [2024-11-07 05:58:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:58:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315948753] [2024-11-07 05:58:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:58:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:58:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat