./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-59.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-59.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', 'f9927c34c970864456f4c5388ccaa1ce21141abde04e0eb758df03be2f9ce8de'] 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-59.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 f9927c34c970864456f4c5388ccaa1ce21141abde04e0eb758df03be2f9ce8de --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:59:30,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:59:30,536 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:59:30,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:59:30,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:59:30,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:59:30,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:59:30,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:59:30,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:59:30,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:59:30,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:59:30,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:59:30,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:59:30,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:59:30,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:59:30,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:59:30,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:59:30,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:59:30,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:59:30,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:59:30,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:59:30,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:59:30,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:59:30,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:59:30,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:59:30,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:59:30,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:59:30,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:59:30,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:59:30,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:59:30,576 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 -> f9927c34c970864456f4c5388ccaa1ce21141abde04e0eb758df03be2f9ce8de [2024-11-07 05:59:30,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:59:30,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:59:30,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:59:30,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:59:30,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:59:30,884 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-59.i [2024-11-07 05:59:32,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:59:32,492 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:59:32,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-59.i [2024-11-07 05:59:32,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd8cb5f9b/465174938f9741809552b6a45d8a727f/FLAGd4f5f8237 [2024-11-07 05:59:32,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd8cb5f9b/465174938f9741809552b6a45d8a727f [2024-11-07 05:59:32,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:59:32,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:59:32,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:59:32,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:59:32,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:59:32,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:32,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f63181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32, skipping insertion in model container [2024-11-07 05:59:32,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:32,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:59:32,723 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-59.i[919,932] [2024-11-07 05:59:32,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:59:32,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:59:32,856 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-59.i[919,932] [2024-11-07 05:59:32,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:59:32,942 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:59:32,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32 WrapperNode [2024-11-07 05:59:32,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:59:32,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:59:32,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:59:32,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:59:32,951 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:59:32" (1/1) ... [2024-11-07 05:59:32,966 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:59:32" (1/1) ... [2024-11-07 05:59:33,029 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-07 05:59:33,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:59:33,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:59:33,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:59:33,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:59:33,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,073 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:59:33,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:59:33,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:59:33,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:59:33,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:59:33,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (1/1) ... [2024-11-07 05:59:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:59:33,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:59:33,139 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:59:33,145 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:59:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:59:33,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:59:33,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:59:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:59:33,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:59:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:59:33,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:59:33,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:59:33,785 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 05:59:33,786 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:59:33,798 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:59:33,800 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:59:33,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:59:33 BoogieIcfgContainer [2024-11-07 05:59:33,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:59:33,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:59:33,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:59:33,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:59:33,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:59:32" (1/3) ... [2024-11-07 05:59:33,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53eb7ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:59:33, skipping insertion in model container [2024-11-07 05:59:33,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:59:32" (2/3) ... [2024-11-07 05:59:33,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53eb7ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:59:33, skipping insertion in model container [2024-11-07 05:59:33,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:59:33" (3/3) ... [2024-11-07 05:59:33,812 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-59.i [2024-11-07 05:59:33,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:59:33,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:59:33,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:59:33,904 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;@74428e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:59:33,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:59:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 05:59:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:59:33,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:59:33,925 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:33,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:59:33,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:59:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1949944083, now seen corresponding path program 1 times [2024-11-07 05:59:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:59:33,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589789932] [2024-11-07 05:59:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:59:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:59:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:59:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:59:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:59:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:59:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:59:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:59:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:59:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:59:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:59:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:59:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:59:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:59:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:59:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:59:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:59:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:59:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:59:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:59:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:59:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:59:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:59:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:59:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:59:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:59:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:59:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:59:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:59:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:59:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:59:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:59:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:59:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:59:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 05:59:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 05:59:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-07 05:59:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:59:34,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589789932] [2024-11-07 05:59:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589789932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:59:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:59:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:59:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93609746] [2024-11-07 05:59:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:59:34,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:59:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:59:34,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:59:34,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:59:34,584 INFO L87 Difference]: Start difference. First operand has 103 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-07 05:59:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:59:34,624 INFO L93 Difference]: Finished difference Result 199 states and 358 transitions. [2024-11-07 05:59:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:59:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2024-11-07 05:59:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:59:34,632 INFO L225 Difference]: With dead ends: 199 [2024-11-07 05:59:34,632 INFO L226 Difference]: Without dead ends: 99 [2024-11-07 05:59:34,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:59:34,639 INFO L432 NwaCegarLoop]: 157 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, 157 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:59:34,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:59:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-07 05:59:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-07 05:59:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 05:59:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 157 transitions. [2024-11-07 05:59:34,693 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 157 transitions. Word has length 214 [2024-11-07 05:59:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:59:34,695 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 157 transitions. [2024-11-07 05:59:34,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-07 05:59:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 157 transitions. [2024-11-07 05:59:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:59:34,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:59:34,701 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:59:34,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:59:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:59:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1951092901, now seen corresponding path program 1 times [2024-11-07 05:59:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:59:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974684147] [2024-11-07 05:59:34,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:59:34,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:59:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:59:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:59:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:59:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:59:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:59:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:59:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:59:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:59:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:59:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:59:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:59:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:59:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:59:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:59:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:59:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:59:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:59:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:59:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:59:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:59:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:59:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:59:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:59:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:59:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:59:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:59:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:59:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:59:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:59:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:59:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:59:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:59:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 05:59:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 05:59:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-07 05:59:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:59:35,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974684147] [2024-11-07 05:59:35,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974684147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:59:35,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:59:35,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:59:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242546780] [2024-11-07 05:59:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:59:35,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:59:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:59:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:59:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:59:35,560 INFO L87 Difference]: Start difference. First operand 99 states and 157 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-07 05:59:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:59:35,864 INFO L93 Difference]: Finished difference Result 292 states and 466 transitions. [2024-11-07 05:59:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:59:35,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-11-07 05:59:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:59:35,873 INFO L225 Difference]: With dead ends: 292 [2024-11-07 05:59:35,873 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 05:59:35,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:59:35,875 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 95 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:59:35,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 455 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:59:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 05:59:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 159. [2024-11-07 05:59:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-07 05:59:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 250 transitions. [2024-11-07 05:59:35,924 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 250 transitions. Word has length 214 [2024-11-07 05:59:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:59:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 250 transitions. [2024-11-07 05:59:35,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-07 05:59:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 250 transitions. [2024-11-07 05:59:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 05:59:35,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:59:35,929 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:59:35,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:59:35,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:59:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1119170, now seen corresponding path program 1 times [2024-11-07 05:59:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:59:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846274258] [2024-11-07 05:59:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:59:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:59:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:59:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:59:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:59:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:59:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:59:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:59:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:59:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:59:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:59:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:59:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:59:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:59:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:59:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:59:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:59:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:59:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:59:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:59:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:59:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:59:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:59:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:59:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 05:59:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:59:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 05:59:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:59:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:59:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:59:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:59:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:59:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:59:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:59:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 05:59:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-07 05:59:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-07 05:59:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:59:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846274258] [2024-11-07 05:59:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846274258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:59:36,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:59:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:59:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422134458] [2024-11-07 05:59:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:59:36,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:59:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:59:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:59:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:59:36,555 INFO L87 Difference]: Start difference. First operand 159 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-07 05:59:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:59:36,794 INFO L93 Difference]: Finished difference Result 379 states and 603 transitions. [2024-11-07 05:59:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:59:36,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-11-07 05:59:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:59:36,798 INFO L225 Difference]: With dead ends: 379 [2024-11-07 05:59:36,798 INFO L226 Difference]: Without dead ends: 283 [2024-11-07 05:59:36,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:59:36,800 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 143 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:59:36,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 486 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:59:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-07 05:59:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 253. [2024-11-07 05:59:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 147 states have internal predecessors, (197), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-07 05:59:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 401 transitions. [2024-11-07 05:59:36,850 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 401 transitions. Word has length 215 [2024-11-07 05:59:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:59:36,850 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 401 transitions. [2024-11-07 05:59:36,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-07 05:59:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 401 transitions. [2024-11-07 05:59:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 05:59:36,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:59:36,854 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:36,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:59:36,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:59:36,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:59:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash -352895184, now seen corresponding path program 1 times [2024-11-07 05:59:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:59:36,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298890884] [2024-11-07 05:59:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:59:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:59:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:59:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75818079] [2024-11-07 05:59:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:59:37,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:59:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:59:37,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:59:37,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 05:59:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:59:37,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-07 05:59:37,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:59:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-07 05:59:40,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:59:52,485 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 05:59:59,383 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 06:00:28,851 WARN L286 SmtUtils]: Spent 14.86s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 06:00:48,923 WARN L286 SmtUtils]: Spent 12.85s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 06:00:56,650 WARN L286 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)