./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-pr-cn_file-10.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73a02241f62dd5f03e40960bce3ebc0277b0698412736895e26f9644edb13c8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:12:09,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:12:09,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:12:09,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:12:09,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:12:09,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:12:09,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:12:09,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:12:09,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:12:09,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:12:09,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:12:09,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:12:09,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:12:09,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:12:09,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:12:09,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:12:09,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:12:09,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:12:09,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:12:09,674 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 -> 73a02241f62dd5f03e40960bce3ebc0277b0698412736895e26f9644edb13c8b [2025-01-09 11:12:09,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:12:09,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:12:09,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:12:09,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:12:09,907 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:12:09,908 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-pr-cn_file-10.i [2025-01-09 11:12:11,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18e13bbbc/72dd7890deb9442eba93d34282d8604a/FLAG4d9f93b72 [2025-01-09 11:12:11,457 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:12:11,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-01-09 11:12:11,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18e13bbbc/72dd7890deb9442eba93d34282d8604a/FLAG4d9f93b72 [2025-01-09 11:12:11,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18e13bbbc/72dd7890deb9442eba93d34282d8604a [2025-01-09 11:12:11,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:12:11,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:12:11,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:12:11,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:12:11,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:12:11,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:12:11" (1/1) ... [2025-01-09 11:12:11,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:11, skipping insertion in model container [2025-01-09 11:12:11,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:12:11" (1/1) ... [2025-01-09 11:12:11,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:12:11,908 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-pr-cn_file-10.i[919,932] [2025-01-09 11:12:11,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:12:11,973 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:12:11,985 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-pr-cn_file-10.i[919,932] [2025-01-09 11:12:12,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:12:12,049 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:12:12,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12 WrapperNode [2025-01-09 11:12:12,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:12:12,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:12:12,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:12:12,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:12:12,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,091 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2025-01-09 11:12:12,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:12:12,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:12:12,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:12:12,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:12:12,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,114 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]. [2025-01-09 11:12:12,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:12:12,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:12:12,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:12:12,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:12:12,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (1/1) ... [2025-01-09 11:12:12,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:12:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:12:12,153 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) [2025-01-09 11:12:12,157 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 [2025-01-09 11:12:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:12:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:12:12,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:12:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:12:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:12:12,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:12:12,235 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:12:12,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:12:12,687 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-09 11:12:12,687 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:12:12,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:12:12,701 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:12:12,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:12:12 BoogieIcfgContainer [2025-01-09 11:12:12,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:12:12,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:12:12,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:12:12,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:12:12,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:12:11" (1/3) ... [2025-01-09 11:12:12,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42549a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:12:12, skipping insertion in model container [2025-01-09 11:12:12,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:12:12" (2/3) ... [2025-01-09 11:12:12,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42549a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:12:12, skipping insertion in model container [2025-01-09 11:12:12,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:12:12" (3/3) ... [2025-01-09 11:12:12,710 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-01-09 11:12:12,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:12:12,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i that has 2 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:12:12,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:12:12,808 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;@2307a898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:12:12,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:12:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:12:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 11:12:12,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:12,825 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:12:12,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:12,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 459461515, now seen corresponding path program 1 times [2025-01-09 11:12:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:12:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-01-09 11:12:12,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:12:12,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 11:12:12,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 11:12:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-01-09 11:12:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:12:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267637413] [2025-01-09 11:12:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267637413] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:12:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633984242] [2025-01-09 11:12:13,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:13,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:12:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:12:13,161 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) [2025-01-09 11:12:13,163 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 [2025-01-09 11:12:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 11:12:13,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 11:12:13,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:13,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:13,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:12:13,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:12:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-01-09 11:12:13,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:12:13,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633984242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:12:13,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:12:13,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:12:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716760165] [2025-01-09 11:12:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:12:13,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:12:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:12:13,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:12:13,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:12:13,441 INFO L87 Difference]: Start difference. First operand has 145 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:12:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:13,470 INFO L93 Difference]: Finished difference Result 284 states and 501 transitions. [2025-01-09 11:12:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:12:13,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 294 [2025-01-09 11:12:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:13,476 INFO L225 Difference]: With dead ends: 284 [2025-01-09 11:12:13,498 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 11:12:13,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:12:13,505 INFO L435 NwaCegarLoop]: 224 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, 224 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 [2025-01-09 11:12:13,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:12:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 11:12:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-01-09 11:12:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:12:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 224 transitions. [2025-01-09 11:12:13,543 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 224 transitions. Word has length 294 [2025-01-09 11:12:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:13,543 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 224 transitions. [2025-01-09 11:12:13,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:12:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 224 transitions. [2025-01-09 11:12:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 11:12:13,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:13,549 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:12:13,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:12:13,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:12:13,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -48893821, now seen corresponding path program 1 times [2025-01-09 11:12:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:12:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407080024] [2025-01-09 11:12:13,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:12:13,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 11:12:13,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 11:12:13,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:12:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:12:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407080024] [2025-01-09 11:12:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407080024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:12:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:12:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:12:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798135663] [2025-01-09 11:12:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:12:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:12:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:12:14,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:12:14,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:12:14,320 INFO L87 Difference]: Start difference. First operand 142 states and 224 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:12:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:14,525 INFO L93 Difference]: Finished difference Result 421 states and 667 transitions. [2025-01-09 11:12:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:12:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 294 [2025-01-09 11:12:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:14,529 INFO L225 Difference]: With dead ends: 421 [2025-01-09 11:12:14,529 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 11:12:14,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:12:14,531 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 134 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:14,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 649 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:12:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 11:12:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 223. [2025-01-09 11:12:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 124 states have internal predecessors, (160), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:12:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2025-01-09 11:12:14,569 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 294 [2025-01-09 11:12:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:14,570 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2025-01-09 11:12:14,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:12:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2025-01-09 11:12:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:12:14,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:14,573 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:12:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:12:14,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 264212160, now seen corresponding path program 1 times [2025-01-09 11:12:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:12:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199149011] [2025-01-09 11:12:14,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:12:14,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:12:14,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:12:14,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:14,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:12:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:12:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:12:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199149011] [2025-01-09 11:12:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199149011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:12:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:12:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:12:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147489777] [2025-01-09 11:12:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:12:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:12:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:12:28,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:12:28,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:12:28,984 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-01-09 11:12:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:12:32,584 INFO L93 Difference]: Finished difference Result 692 states and 1062 transitions. [2025-01-09 11:12:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:12:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 295 [2025-01-09 11:12:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:12:32,591 INFO L225 Difference]: With dead ends: 692 [2025-01-09 11:12:32,591 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 11:12:32,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-01-09 11:12:32,593 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 1189 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:12:32,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 1879 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 11:12:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 11:12:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 420. [2025-01-09 11:12:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 267 states have (on average 1.3558052434456929) internal successors, (362), 268 states have internal predecessors, (362), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 11:12:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 650 transitions. [2025-01-09 11:12:32,630 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 650 transitions. Word has length 295 [2025-01-09 11:12:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:12:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 650 transitions. [2025-01-09 11:12:32,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-01-09 11:12:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 650 transitions. [2025-01-09 11:12:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:12:32,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:12:32,633 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:12:32,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:12:32,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:12:32,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:12:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash 944270530, now seen corresponding path program 1 times [2025-01-09 11:12:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:12:32,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329943932] [2025-01-09 11:12:32,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:12:32,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:12:32,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:12:32,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:12:32,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:12:32,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:13:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:13:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:13:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329943932] [2025-01-09 11:13:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329943932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:13:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:13:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 11:13:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830870639] [2025-01-09 11:13:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:13:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 11:13:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:13:13,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 11:13:13,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:13:13,442 INFO L87 Difference]: Start difference. First operand 420 states and 650 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:13:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:13:15,351 INFO L93 Difference]: Finished difference Result 865 states and 1329 transitions. [2025-01-09 11:13:15,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:13:15,352 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-01-09 11:13:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:13:15,356 INFO L225 Difference]: With dead ends: 865 [2025-01-09 11:13:15,357 INFO L226 Difference]: Without dead ends: 535 [2025-01-09 11:13:15,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-01-09 11:13:15,358 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 464 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:13:15,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1821 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:13:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-01-09 11:13:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2025-01-09 11:13:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 268 states have (on average 1.3544776119402986) internal successors, (363), 269 states have internal predecessors, (363), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 11:13:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2025-01-09 11:13:15,385 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 295 [2025-01-09 11:13:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:13:15,385 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2025-01-09 11:13:15,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 11:13:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2025-01-09 11:13:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:13:15,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:13:15,389 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:13:15,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:13:15,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:13:15,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:13:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash -883913280, now seen corresponding path program 1 times [2025-01-09 11:13:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:13:15,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484636774] [2025-01-09 11:13:15,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:13:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:13:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:13:15,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:13:15,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:13:15,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:13:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:13:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:13:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484636774] [2025-01-09 11:13:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484636774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:13:31,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:13:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:13:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535839538] [2025-01-09 11:13:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:13:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:13:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:13:31,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:13:31,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:13:31,323 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-01-09 11:13:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:13:34,462 INFO L93 Difference]: Finished difference Result 696 states and 1062 transitions. [2025-01-09 11:13:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 11:13:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 295 [2025-01-09 11:13:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:13:34,465 INFO L225 Difference]: With dead ends: 696 [2025-01-09 11:13:34,465 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 11:13:34,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2025-01-09 11:13:34,467 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 1439 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:13:34,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 1902 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 11:13:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 11:13:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 422. [2025-01-09 11:13:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 269 states have (on average 1.3531598513011152) internal successors, (364), 270 states have internal predecessors, (364), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 11:13:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 652 transitions. [2025-01-09 11:13:34,493 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 652 transitions. Word has length 295 [2025-01-09 11:13:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:13:34,495 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 652 transitions. [2025-01-09 11:13:34,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-01-09 11:13:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 652 transitions. [2025-01-09 11:13:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:13:34,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:13:34,500 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:13:34,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:13:34,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:13:34,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:13:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 522377598, now seen corresponding path program 1 times [2025-01-09 11:13:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:13:34,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382150103] [2025-01-09 11:13:34,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:13:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:13:34,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:13:34,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:13:34,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:13:34,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:13:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 11:13:39,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:13:39,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382150103] [2025-01-09 11:13:39,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382150103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:13:39,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:13:39,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:13:39,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757847046] [2025-01-09 11:13:39,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:13:39,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:13:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:13:39,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:13:39,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:13:39,434 INFO L87 Difference]: Start difference. First operand 422 states and 652 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:13:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:13:40,380 INFO L93 Difference]: Finished difference Result 718 states and 1091 transitions. [2025-01-09 11:13:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 11:13:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-01-09 11:13:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:13:40,384 INFO L225 Difference]: With dead ends: 718 [2025-01-09 11:13:40,384 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 11:13:40,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:13:40,385 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 719 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:13:40,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1382 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:13:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 11:13:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 424. [2025-01-09 11:13:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 271 states have (on average 1.3542435424354244) internal successors, (367), 272 states have internal predecessors, (367), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 11:13:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 655 transitions. [2025-01-09 11:13:40,414 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 655 transitions. Word has length 295 [2025-01-09 11:13:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:13:40,415 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 655 transitions. [2025-01-09 11:13:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-01-09 11:13:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 655 transitions. [2025-01-09 11:13:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 11:13:40,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:13:40,417 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:13:40,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:13:40,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:13:40,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:13:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash -625747842, now seen corresponding path program 1 times [2025-01-09 11:13:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:13:40,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584817622] [2025-01-09 11:13:40,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:13:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:13:40,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 11:13:40,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 11:13:40,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:13:40,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat