./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.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_fillercodesize_ps-cn-25_file-10.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', '4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99'] 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_fillercodesize_ps-cn-25_file-10.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 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:11:49,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:11:49,839 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:11:49,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:11:49,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:11:49,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:11:49,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:11:49,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:11:49,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:11:49,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:11:49,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:11:49,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:11:49,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:11:49,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:11:49,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:11:49,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:11:49,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:11:49,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:11:49,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:11:49,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:11:49,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:11:49,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:11:49,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:11:49,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:11:49,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:11:49,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:11:49,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:11:49,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:11:49,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:11:49,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:11:49,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:11:49,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:11:49,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:11:49,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:11:49,883 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 -> 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 [2024-11-07 05:11:50,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:11:50,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:11:50,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:11:50,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:11:50,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:11:50,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-07 05:11:51,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:11:51,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:11:51,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-07 05:11:51,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/070cac685/ae7726b257ae4457803bea921b78b01a/FLAG1f7f81015 [2024-11-07 05:11:51,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/070cac685/ae7726b257ae4457803bea921b78b01a [2024-11-07 05:11:51,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:11:51,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:11:51,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:11:51,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:11:51,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:11:51,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:51" (1/1) ... [2024-11-07 05:11:51,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458d76c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:51, skipping insertion in model container [2024-11-07 05:11:51,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:11:51" (1/1) ... [2024-11-07 05:11:51,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:11:52,067 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_fillercodesize_ps-cn-25_file-10.i[915,928] [2024-11-07 05:11:52,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:11:52,189 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:11:52,199 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_fillercodesize_ps-cn-25_file-10.i[915,928] [2024-11-07 05:11:52,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:11:52,269 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:11:52,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52 WrapperNode [2024-11-07 05:11:52,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:11:52,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:11:52,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:11:52,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:11:52,279 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:11:52" (1/1) ... [2024-11-07 05:11:52,295 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:11:52" (1/1) ... [2024-11-07 05:11:52,353 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-07 05:11:52,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:11:52,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:11:52,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:11:52,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:11:52,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,394 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:11:52,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:11:52,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:11:52,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:11:52,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:11:52,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (1/1) ... [2024-11-07 05:11:52,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:11:52,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:11:52,457 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:11:52,460 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:11:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:11:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:11:52,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:11:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:11:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:11:52,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:11:52,574 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:11:52,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:11:53,047 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-07 05:11:53,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:11:53,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:11:53,065 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:11:53,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:53 BoogieIcfgContainer [2024-11-07 05:11:53,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:11:53,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:11:53,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:11:53,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:11:53,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:11:51" (1/3) ... [2024-11-07 05:11:53,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3d90d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:53, skipping insertion in model container [2024-11-07 05:11:53,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:11:52" (2/3) ... [2024-11-07 05:11:53,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d3d90d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:11:53, skipping insertion in model container [2024-11-07 05:11:53,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:11:53" (3/3) ... [2024-11-07 05:11:53,079 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-07 05:11:53,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:11:53,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:11:53,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:11:53,166 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;@125e7a2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:11:53,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:11:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:11:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 05:11:53,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:11:53,189 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:53,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:11:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:11:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash -133426666, now seen corresponding path program 1 times [2024-11-07 05:11:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:11:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120397028] [2024-11-07 05:11:53,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:11:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:11:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:11:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:11:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:11:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:11:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:11:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:11:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:11:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:11:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:11:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:11:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:11:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:11:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:11:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:11:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:11:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:11:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:11:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:11:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:11:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:11:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:11:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:11:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:11:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:11:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:11:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:11:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:11:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:11:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:11:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:11:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:11:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 05:11:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:11:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:11:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120397028] [2024-11-07 05:11:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120397028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:11:53,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:11:53,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:11:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428573232] [2024-11-07 05:11:53,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:11:53,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:11:53,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:11:53,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:11:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:11:53,806 INFO L87 Difference]: Start difference. First operand has 105 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:11:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:11:53,843 INFO L93 Difference]: Finished difference Result 203 states and 344 transitions. [2024-11-07 05:11:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:11:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2024-11-07 05:11:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:11:53,853 INFO L225 Difference]: With dead ends: 203 [2024-11-07 05:11:53,854 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 05:11:53,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:11:53,863 INFO L432 NwaCegarLoop]: 152 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, 152 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:11:53,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:11:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 05:11:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-07 05:11:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:11:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2024-11-07 05:11:53,921 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 208 [2024-11-07 05:11:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:11:53,924 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2024-11-07 05:11:53,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:11:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2024-11-07 05:11:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-07 05:11:53,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:11:53,932 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:53,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:11:53,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:11:53,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:11:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 375102870, now seen corresponding path program 1 times [2024-11-07 05:11:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:11:53,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127880553] [2024-11-07 05:11:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:11:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:11:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:11:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:11:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:11:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:11:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:11:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:11:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:11:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:11:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:11:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:11:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:11:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:11:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:11:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:11:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:11:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:11:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:11:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:11:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:11:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:11:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:11:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:11:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:11:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:11:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:11:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:11:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:11:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:11:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:11:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:11:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:11:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 05:11:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:11:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:11:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:11:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127880553] [2024-11-07 05:11:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127880553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:11:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:11:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:11:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892589360] [2024-11-07 05:11:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:11:54,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:11:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:11:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:11:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:11:54,826 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:11:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:11:55,132 INFO L93 Difference]: Finished difference Result 298 states and 451 transitions. [2024-11-07 05:11:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:11:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-07 05:11:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:11:55,140 INFO L225 Difference]: With dead ends: 298 [2024-11-07 05:11:55,140 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 05:11:55,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:11:55,142 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 98 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:11:55,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 579 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:11:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 05:11:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 166. [2024-11-07 05:11:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 05:11:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2024-11-07 05:11:55,189 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 208 [2024-11-07 05:11:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:11:55,191 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2024-11-07 05:11:55,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:11:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2024-11-07 05:11:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 05:11:55,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:11:55,194 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:11:55,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:11:55,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:11:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1872658368, now seen corresponding path program 1 times [2024-11-07 05:11:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:11:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952482538] [2024-11-07 05:11:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:11:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:11:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:12:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:12:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:12:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:12:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:12:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:12:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:12:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:12:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:12:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:12:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:12:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:12:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:12:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:12:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:12:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:12:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:12:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:12:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:12:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:12:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:12:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:12:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:12:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:12:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:12:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:12:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:12:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:12:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:12:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:12:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:12:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 05:12:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:12:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:12:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:12:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952482538] [2024-11-07 05:12:49,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952482538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:12:49,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:12:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 05:12:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304254754] [2024-11-07 05:12:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:12:49,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 05:12:49,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:12:49,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 05:12:49,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:12:49,597 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-07 05:12:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:12:52,822 INFO L93 Difference]: Finished difference Result 487 states and 711 transitions. [2024-11-07 05:12:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 05:12:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 209 [2024-11-07 05:12:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:12:52,827 INFO L225 Difference]: With dead ends: 487 [2024-11-07 05:12:52,827 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 05:12:52,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-11-07 05:12:52,829 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 691 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 05:12:52,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1004 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 05:12:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 05:12:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 299. [2024-11-07 05:12:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 195 states have internal predecessors, (243), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 05:12:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 435 transitions. [2024-11-07 05:12:52,875 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 435 transitions. Word has length 209 [2024-11-07 05:12:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:12:52,876 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 435 transitions. [2024-11-07 05:12:52,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-07 05:12:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 435 transitions. [2024-11-07 05:12:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 05:12:52,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:12:52,879 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:12:52,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:12:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:12:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2130823806, now seen corresponding path program 1 times [2024-11-07 05:12:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:12:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013248835] [2024-11-07 05:12:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:12:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:12:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:13:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:13:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:13:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:13:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:13:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:13:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:13:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:13:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:13:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:13:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:13:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:13:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:13:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:13:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:13:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:13:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:13:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:13:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:13:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:13:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:13:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:13:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:13:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:13:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:13:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:13:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:13:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:13:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:13:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:13:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 05:13:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-07 05:13:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:13:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:13:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:13:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013248835] [2024-11-07 05:13:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013248835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:13:09,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:13:09,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 05:13:09,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104538214] [2024-11-07 05:13:09,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:13:09,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 05:13:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:13:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 05:13:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:13:09,479 INFO L87 Difference]: Start difference. First operand 299 states and 435 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:13:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:13:11,956 INFO L93 Difference]: Finished difference Result 539 states and 767 transitions. [2024-11-07 05:13:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 05:13:11,957 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-07 05:13:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:13:11,961 INFO L225 Difference]: With dead ends: 539 [2024-11-07 05:13:11,961 INFO L226 Difference]: Without dead ends: 441 [2024-11-07 05:13:11,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2024-11-07 05:13:11,962 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 609 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:13:11,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1130 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 05:13:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-07 05:13:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 301. [2024-11-07 05:13:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 197 states have internal predecessors, (246), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 05:13:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 438 transitions. [2024-11-07 05:13:12,004 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 438 transitions. Word has length 209 [2024-11-07 05:13:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:13:12,004 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 438 transitions. [2024-11-07 05:13:12,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:13:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 438 transitions. [2024-11-07 05:13:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-07 05:13:12,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:13:12,007 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:12,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:13:12,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:13:12,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:13:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1016018050, now seen corresponding path program 1 times [2024-11-07 05:13:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:13:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800985649] [2024-11-07 05:13:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:13:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:13:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat