./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.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-ps-ci_file-54.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', '011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756'] 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-ps-ci_file-54.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 011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:54:01,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:54:01,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:54:01,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:54:01,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:54:01,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:54:01,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:54:01,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:54:01,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:54:01,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:54:01,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:54:01,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:54:01,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:54:01,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:54:01,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:54:01,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:54:01,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:54:01,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:54:01,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:54:01,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:54:01,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:54:01,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:54:01,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:54:01,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:54:01,404 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 -> 011eeefd9cffe2be7e7193891aba89325b816eb252a09909cc785439e897f756 [2024-11-07 06:54:01,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:54:01,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:54:01,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:54:01,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:54:01,742 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:54:01,744 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-ps-ci_file-54.i [2024-11-07 06:54:03,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:54:03,291 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:54:03,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-07 06:54:03,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b969548b4/6d8efbf1ba3d4f0c8527c2f97ad4cd3e/FLAGcd0fcd3e4 [2024-11-07 06:54:03,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b969548b4/6d8efbf1ba3d4f0c8527c2f97ad4cd3e [2024-11-07 06:54:03,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:54:03,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:54:03,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:54:03,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:54:03,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:54:03,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702cc795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03, skipping insertion in model container [2024-11-07 06:54:03,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:54:03,490 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-ps-ci_file-54.i[919,932] [2024-11-07 06:54:03,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:54:03,595 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:54:03,607 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-ps-ci_file-54.i[919,932] [2024-11-07 06:54:03,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:54:03,678 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:54:03,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03 WrapperNode [2024-11-07 06:54:03,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:54:03,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:54:03,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:54:03,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:54:03,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,738 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 06:54:03,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:54:03,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:54:03,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:54:03,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:54:03,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,783 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 06:54:03,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:54:03,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:54:03,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:54:03,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:54:03,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (1/1) ... [2024-11-07 06:54:03,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:54:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:54:03,843 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 06:54:03,849 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 06:54:03,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:54:03,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:54:03,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:54:03,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:54:03,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:54:03,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:54:03,964 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:54:03,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:54:04,416 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 06:54:04,417 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:54:04,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:54:04,431 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:54:04,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:54:04 BoogieIcfgContainer [2024-11-07 06:54:04,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:54:04,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:54:04,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:54:04,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:54:04,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:54:03" (1/3) ... [2024-11-07 06:54:04,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c735e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:54:04, skipping insertion in model container [2024-11-07 06:54:04,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:54:03" (2/3) ... [2024-11-07 06:54:04,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c735e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:54:04, skipping insertion in model container [2024-11-07 06:54:04,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:54:04" (3/3) ... [2024-11-07 06:54:04,443 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-54.i [2024-11-07 06:54:04,457 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:54:04,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:54:04,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:54:04,529 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;@459c1e56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:54:04,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:54:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 06:54:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 06:54:04,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:04,551 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:04,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1434156324, now seen corresponding path program 1 times [2024-11-07 06:54:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988202210] [2024-11-07 06:54:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:54:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:54:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:54:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:54:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:54:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:54:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:54:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:54:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:54:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:54:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:54:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:54:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:54:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:54:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:54:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:54:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:54:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:54:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:54:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:54:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:54:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:54:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:54:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:54:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:54:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:54:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:54:05,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988202210] [2024-11-07 06:54:05,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988202210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:54:05,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:54:05,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:54:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616306445] [2024-11-07 06:54:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:54:05,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:54:05,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:54:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:54:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:54:05,058 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 06:54:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:54:05,114 INFO L93 Difference]: Finished difference Result 163 states and 285 transitions. [2024-11-07 06:54:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:54:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-07 06:54:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:54:05,123 INFO L225 Difference]: With dead ends: 163 [2024-11-07 06:54:05,123 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 06:54:05,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 06:54:05,132 INFO L432 NwaCegarLoop]: 126 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, 126 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 06:54:05,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:54:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 06:54:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 06:54:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 06:54:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-07 06:54:05,184 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 167 [2024-11-07 06:54:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:54:05,185 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-07 06:54:05,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 06:54:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-07 06:54:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 06:54:05,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:05,190 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:05,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:54:05,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:05,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:05,191 INFO L85 PathProgramCache]: Analyzing trace with hash -783815582, now seen corresponding path program 1 times [2024-11-07 06:54:05,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:05,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540448642] [2024-11-07 06:54:05,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:05,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:54:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:54:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:54:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:54:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:54:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:54:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:54:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:54:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:54:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:54:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:54:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:54:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:54:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:54:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:54:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:54:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:54:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:54:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:54:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:54:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:54:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:54:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:54:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:54:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:54:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:54:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:54:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540448642] [2024-11-07 06:54:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540448642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:54:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:54:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:54:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20020709] [2024-11-07 06:54:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:54:05,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:54:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:54:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:54:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:54:05,810 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:54:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:54:06,027 INFO L93 Difference]: Finished difference Result 220 states and 339 transitions. [2024-11-07 06:54:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:54:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 06:54:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:54:06,031 INFO L225 Difference]: With dead ends: 220 [2024-11-07 06:54:06,034 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 06:54:06,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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 06:54:06,035 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 108 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:54:06,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 321 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:54:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 06:54:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2024-11-07 06:54:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 06:54:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2024-11-07 06:54:06,065 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 167 [2024-11-07 06:54:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:54:06,066 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2024-11-07 06:54:06,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:54:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2024-11-07 06:54:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 06:54:06,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:06,072 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:06,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:54:06,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1220943712, now seen corresponding path program 1 times [2024-11-07 06:54:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440064281] [2024-11-07 06:54:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:54:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:54:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:54:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:54:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:54:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:54:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:54:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:54:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:54:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:54:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:54:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:54:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:54:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:54:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:54:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:54:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:54:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:54:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:54:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:54:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:54:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:54:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:54:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:54:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:54:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:54:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:54:06,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440064281] [2024-11-07 06:54:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440064281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:54:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:54:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:54:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545761203] [2024-11-07 06:54:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:54:06,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:54:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:54:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:54:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:54:06,596 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:54:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:54:06,808 INFO L93 Difference]: Finished difference Result 319 states and 497 transitions. [2024-11-07 06:54:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:54:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-07 06:54:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:54:06,813 INFO L225 Difference]: With dead ends: 319 [2024-11-07 06:54:06,814 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 06:54:06,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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 06:54:06,817 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 106 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:54:06,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 361 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:54:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 06:54:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 183. [2024-11-07 06:54:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 127 states have internal predecessors, (180), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 06:54:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 284 transitions. [2024-11-07 06:54:06,875 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 284 transitions. Word has length 167 [2024-11-07 06:54:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:54:06,877 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 284 transitions. [2024-11-07 06:54:06,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:54:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 284 transitions. [2024-11-07 06:54:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 06:54:06,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:06,883 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:54:06,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:06,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1452642644, now seen corresponding path program 1 times [2024-11-07 06:54:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487726277] [2024-11-07 06:54:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:54:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:54:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:54:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:54:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:54:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:54:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:54:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:54:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:54:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:54:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:54:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:54:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:54:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:54:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:54:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:54:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:54:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:54:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:54:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:54:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:54:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:54:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:54:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:54:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:54:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 06:54:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:54:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487726277] [2024-11-07 06:54:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487726277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:54:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:54:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:54:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034248443] [2024-11-07 06:54:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:54:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:54:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:54:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:54:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:54:07,417 INFO L87 Difference]: Start difference. First operand 183 states and 284 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:54:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:54:07,689 INFO L93 Difference]: Finished difference Result 411 states and 644 transitions. [2024-11-07 06:54:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:54:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-07 06:54:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:54:07,693 INFO L225 Difference]: With dead ends: 411 [2024-11-07 06:54:07,693 INFO L226 Difference]: Without dead ends: 299 [2024-11-07 06:54:07,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:54:07,694 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 87 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:54:07,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 356 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:54:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-07 06:54:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2024-11-07 06:54:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 205 states have (on average 1.448780487804878) internal successors, (297), 207 states have internal predecessors, (297), 79 states have call successors, (79), 6 states have call predecessors, (79), 6 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-07 06:54:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 455 transitions. [2024-11-07 06:54:07,766 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 455 transitions. Word has length 168 [2024-11-07 06:54:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:54:07,767 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 455 transitions. [2024-11-07 06:54:07,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 06:54:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 455 transitions. [2024-11-07 06:54:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 06:54:07,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:07,769 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:54:07,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:07,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash 848179946, now seen corresponding path program 1 times [2024-11-07 06:54:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928419256] [2024-11-07 06:54:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:54:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:54:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:54:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:54:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:54:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:54:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:54:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:54:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 06:54:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:54:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 06:54:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:54:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 06:54:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:54:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:54:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:54:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:54:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:54:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:54:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:54:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 06:54:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 06:54:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 06:54:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 06:54:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 06:54:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 06:54:08,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:54:08,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928419256] [2024-11-07 06:54:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928419256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:54:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657238878] [2024-11-07 06:54:08,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:08,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:54:08,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:54:08,194 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 06:54:08,195 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 06:54:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:08,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:54:08,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:54:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-07 06:54:08,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:54:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 06:54:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657238878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:54:08,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:54:08,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 06:54:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744277756] [2024-11-07 06:54:08,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:54:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:54:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:54:08,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:54:08,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:54:08,922 INFO L87 Difference]: Start difference. First operand 291 states and 455 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 06:54:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:54:09,165 INFO L93 Difference]: Finished difference Result 532 states and 823 transitions. [2024-11-07 06:54:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 06:54:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 168 [2024-11-07 06:54:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:54:09,170 INFO L225 Difference]: With dead ends: 532 [2024-11-07 06:54:09,170 INFO L226 Difference]: Without dead ends: 309 [2024-11-07 06:54:09,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:54:09,171 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 112 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:54:09,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 254 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:54:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-07 06:54:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 303. [2024-11-07 06:54:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 214 states have (on average 1.4018691588785046) internal successors, (300), 216 states have internal predecessors, (300), 79 states have call successors, (79), 9 states have call predecessors, (79), 9 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-07 06:54:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 458 transitions. [2024-11-07 06:54:09,229 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 458 transitions. Word has length 168 [2024-11-07 06:54:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:54:09,230 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 458 transitions. [2024-11-07 06:54:09,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-07 06:54:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 458 transitions. [2024-11-07 06:54:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 06:54:09,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:54:09,232 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:54:09,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:54:09,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:54:09,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:54:09,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:54:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash -740167956, now seen corresponding path program 1 times [2024-11-07 06:54:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:54:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733200316] [2024-11-07 06:54:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:09,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:54:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:54:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806041307] [2024-11-07 06:54:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:54:09,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:54:09,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:54:09,588 INFO L229 MonitoredProcess]: Starting monitored process 3 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 06:54:09,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:54:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:54:09,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 06:54:09,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:54:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 824 proven. 135 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-07 06:54:11,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:54:19,625 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)