./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.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_codestructure_dependencies_file-64.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', '2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25'] 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_codestructure_dependencies_file-64.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 2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:59:16,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:59:16,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:59:16,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:59:16,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:59:16,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:59:16,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:59:16,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:59:16,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:59:16,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:59:16,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:59:16,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:59:16,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:59:16,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:59:16,732 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:59:16,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:59:16,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:59:16,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:59:16,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:59:16,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:59:16,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:59:16,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:59:16,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:59:16,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:59:16,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:59:16,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:59:16,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:59:16,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:59:16,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:59:16,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:59:16,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:59:16,736 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 -> 2296f8bb93bd4140c35d0b2800df8c874c564098ef0aa8a507c2732dcd35dc25 [2024-11-07 03:59:17,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:59:17,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:59:17,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:59:17,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:59:17,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:59:17,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i [2024-11-07 03:59:18,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:59:18,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:59:18,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-64.i [2024-11-07 03:59:18,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1037065b0/37c169c4f8c1430790367b15b5439f2f/FLAG74a623698 [2024-11-07 03:59:18,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1037065b0/37c169c4f8c1430790367b15b5439f2f [2024-11-07 03:59:18,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:59:18,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:59:18,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:59:18,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:59:18,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:59:18,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:18,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55810530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18, skipping insertion in model container [2024-11-07 03:59:18,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:18,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:59:18,890 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_codestructure_dependencies_file-64.i[919,932] [2024-11-07 03:59:18,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:59:18,946 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:59:18,957 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_codestructure_dependencies_file-64.i[919,932] [2024-11-07 03:59:18,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:59:18,995 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:59:18,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18 WrapperNode [2024-11-07 03:59:18,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:59:18,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:59:18,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:59:18,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:59:19,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,045 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-07 03:59:19,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:59:19,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:59:19,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:59:19,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:59:19,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,068 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 03:59:19,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:59:19,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:59:19,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:59:19,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:59:19,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (1/1) ... [2024-11-07 03:59:19,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:59:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:59:19,121 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 03:59:19,124 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 03:59:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:59:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:59:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:59:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:59:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:59:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:59:19,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:59:19,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:59:19,543 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 03:59:19,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:59:19,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:59:19,558 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:59:19,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:19 BoogieIcfgContainer [2024-11-07 03:59:19,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:59:19,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:59:19,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:59:19,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:59:19,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:59:18" (1/3) ... [2024-11-07 03:59:19,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcbf90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:59:19, skipping insertion in model container [2024-11-07 03:59:19,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:59:18" (2/3) ... [2024-11-07 03:59:19,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcbf90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:59:19, skipping insertion in model container [2024-11-07 03:59:19,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:59:19" (3/3) ... [2024-11-07 03:59:19,569 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-64.i [2024-11-07 03:59:19,583 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:59:19,584 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:59:19,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:59:19,657 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;@42d9c613, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:59:19,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:59:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:59:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 03:59:19,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:19,681 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:19,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:19,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 479836151, now seen corresponding path program 1 times [2024-11-07 03:59:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:19,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110043579] [2024-11-07 03:59:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:19,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:59:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:59:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:59:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:59:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:59:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:59:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:59:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:59:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:59:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:59:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:59:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:59:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:59:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 03:59:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 03:59:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 03:59:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110043579] [2024-11-07 03:59:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110043579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:20,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:59:20,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043156999] [2024-11-07 03:59:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:59:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:59:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:59:20,159 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 03:59:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:20,191 INFO L93 Difference]: Finished difference Result 141 states and 248 transitions. [2024-11-07 03:59:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:59:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-11-07 03:59:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:20,201 INFO L225 Difference]: With dead ends: 141 [2024-11-07 03:59:20,201 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 03:59:20,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 03:59:20,210 INFO L432 NwaCegarLoop]: 107 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, 107 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 03:59:20,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:59:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 03:59:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 03:59:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:59:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2024-11-07 03:59:20,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 162 [2024-11-07 03:59:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:20,269 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2024-11-07 03:59:20,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 03:59:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2024-11-07 03:59:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 03:59:20,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:20,273 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:20,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:59:20,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:20,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash -880345417, now seen corresponding path program 1 times [2024-11-07 03:59:20,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:20,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193345359] [2024-11-07 03:59:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:59:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:59:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:59:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:59:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:59:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:59:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:59:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:59:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:59:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:59:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:59:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:59:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:59:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 03:59:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 03:59:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 03:59:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193345359] [2024-11-07 03:59:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193345359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:59:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124240430] [2024-11-07 03:59:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:59:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:59:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:59:23,990 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 03:59:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:24,493 INFO L93 Difference]: Finished difference Result 244 states and 375 transitions. [2024-11-07 03:59:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:59:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-07 03:59:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:24,496 INFO L225 Difference]: With dead ends: 244 [2024-11-07 03:59:24,497 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 03:59:24,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:59:24,503 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 127 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:24,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 458 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 03:59:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 03:59:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 74. [2024-11-07 03:59:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:59:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-07 03:59:24,531 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 162 [2024-11-07 03:59:24,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:24,534 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-07 03:59:24,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 03:59:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-07 03:59:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 03:59:24,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:24,538 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:24,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:59:24,539 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -363192393, now seen corresponding path program 1 times [2024-11-07 03:59:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993712249] [2024-11-07 03:59:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:59:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:59:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:59:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:59:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:59:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:59:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:59:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:59:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:59:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:59:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:59:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:59:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:59:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 03:59:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 03:59:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 03:59:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:24,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993712249] [2024-11-07 03:59:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993712249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:59:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021212938] [2024-11-07 03:59:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:59:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:59:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:59:24,873 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 03:59:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:25,126 INFO L93 Difference]: Finished difference Result 217 states and 328 transitions. [2024-11-07 03:59:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:59:25,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-07 03:59:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:25,130 INFO L225 Difference]: With dead ends: 217 [2024-11-07 03:59:25,131 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 03:59:25,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:59:25,133 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 117 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:25,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 486 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:59:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 03:59:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 74. [2024-11-07 03:59:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:59:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-07 03:59:25,155 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 162 [2024-11-07 03:59:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:25,156 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-07 03:59:25,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 03:59:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-07 03:59:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 03:59:25,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:25,161 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:25,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:59:25,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:25,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1172539019, now seen corresponding path program 1 times [2024-11-07 03:59:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380941375] [2024-11-07 03:59:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:59:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:59:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:59:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:59:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:59:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:59:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:59:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:59:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:59:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:59:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:59:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:59:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:59:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:59:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:59:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:59:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:59:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:59:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:59:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:59:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:59:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:59:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:59:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:59:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 03:59:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 03:59:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:59:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 03:59:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:59:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380941375] [2024-11-07 03:59:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380941375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:59:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:59:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:59:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645326642] [2024-11-07 03:59:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:59:25,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:59:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:59:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:59:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:59:25,457 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 03:59:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:59:25,644 INFO L93 Difference]: Finished difference Result 217 states and 327 transitions. [2024-11-07 03:59:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:59:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-07 03:59:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:59:25,647 INFO L225 Difference]: With dead ends: 217 [2024-11-07 03:59:25,647 INFO L226 Difference]: Without dead ends: 146 [2024-11-07 03:59:25,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:59:25,648 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 107 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:59:25,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 534 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:59:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-07 03:59:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 70. [2024-11-07 03:59:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 03:59:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-07 03:59:25,672 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 162 [2024-11-07 03:59:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:59:25,675 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-07 03:59:25,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 03:59:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-07 03:59:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 03:59:25,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:59:25,678 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:25,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:59:25,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:59:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:59:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash -451843534, now seen corresponding path program 1 times [2024-11-07 03:59:25,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:59:25,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618655659] [2024-11-07 03:59:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:59:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:59:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat