./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d1cb787af494abcaff939caeb847017cf6182011ac4c5e249d82499aa017392f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:00:52,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:00:52,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:00:52,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:00:52,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:00:52,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:00:52,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:00:52,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:00:52,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:00:52,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:00:52,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:00:52,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:00:52,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:00:52,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:00:52,907 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:00:52,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:00:52,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:00:52,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:00:52,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:00:52,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:00:52,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:00:52,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:00:52,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:00:52,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:00:52,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:00:52,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:00:52,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:00:52,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:00:52,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:00:52,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:00:52,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:00:52,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:00:52,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:00:52,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:00:52,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:00:52,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:00:52,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:00:52,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:00:52,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:00:52,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:00:52,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:00:52,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:00:52,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> d1cb787af494abcaff939caeb847017cf6182011ac4c5e249d82499aa017392f [2024-11-20 04:00:53,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:00:53,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:00:53,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:00:53,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:00:53,213 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:00:53,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i [2024-11-20 04:00:54,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:00:54,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:00:54,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i [2024-11-20 04:00:54,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5c72ee/6d70921ae13c47f08d6c18ff0aa8d1e5/FLAG74498e928 [2024-11-20 04:00:55,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5c72ee/6d70921ae13c47f08d6c18ff0aa8d1e5 [2024-11-20 04:00:55,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:00:55,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:00:55,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:00:55,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:00:55,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:00:55,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad24622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55, skipping insertion in model container [2024-11-20 04:00:55,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:00:55,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i[919,932] [2024-11-20 04:00:55,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:00:55,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:00:55,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i[919,932] [2024-11-20 04:00:55,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:00:55,740 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:00:55,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55 WrapperNode [2024-11-20 04:00:55,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:00:55,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:00:55,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:00:55,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:00:55,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,833 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-11-20 04:00:55,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:00:55,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:00:55,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:00:55,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:00:55,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,977 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-20 04:00:55,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:55,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:56,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:56,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:56,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:56,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:56,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:00:56,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:00:56,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:00:56,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:00:56,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (1/1) ... [2024-11-20 04:00:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:00:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:00:56,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:00:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:00:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:00:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:00:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:00:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:00:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:00:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:00:56,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:00:56,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:00:56,810 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 04:00:56,810 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:00:56,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:00:56,829 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:00:56,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:00:56 BoogieIcfgContainer [2024-11-20 04:00:56,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:00:56,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:00:56,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:00:56,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:00:56,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:00:55" (1/3) ... [2024-11-20 04:00:56,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15686729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:00:56, skipping insertion in model container [2024-11-20 04:00:56,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:00:55" (2/3) ... [2024-11-20 04:00:56,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15686729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:00:56, skipping insertion in model container [2024-11-20 04:00:56,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:00:56" (3/3) ... [2024-11-20 04:00:56,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-28.i [2024-11-20 04:00:56,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:00:56,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:00:56,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:00:56,924 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;@4b749478, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:00:56,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:00:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 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-20 04:00:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 04:00:56,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:00:56,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:00:56,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:00:56,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:00:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1157361710, now seen corresponding path program 1 times [2024-11-20 04:00:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:00:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480545111] [2024-11-20 04:00:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:00:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:00:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:00:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:00:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:00:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:00:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:00:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:00:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:00:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:00:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:00:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:00:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:00:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:00:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:00:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:00:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:00:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:00:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:00:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:00:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:00:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:00:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:00:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:00:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:00:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:00:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:00:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:00:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:57,515 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-20 04:00:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:00:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480545111] [2024-11-20 04:00:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480545111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:00:57,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:00:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:00:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389321394] [2024-11-20 04:00:57,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:00:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:00:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:00:57,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:00:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:00:57,575 INFO L87 Difference]: Start difference. First operand has 100 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-20 04:00:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:00:57,654 INFO L93 Difference]: Finished difference Result 193 states and 330 transitions. [2024-11-20 04:00:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:00:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 177 [2024-11-20 04:00:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:00:57,673 INFO L225 Difference]: With dead ends: 193 [2024-11-20 04:00:57,673 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 04:00:57,677 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-20 04:00:57,687 INFO L432 NwaCegarLoop]: 148 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, 148 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-20 04:00:57,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:00:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 04:00:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 04:00:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 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-20 04:00:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-11-20 04:00:57,741 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 177 [2024-11-20 04:00:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:00:57,741 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-11-20 04:00:57,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-20 04:00:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2024-11-20 04:00:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 04:00:57,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:00:57,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:00:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:00:57,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:00:57,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:00:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1147212682, now seen corresponding path program 1 times [2024-11-20 04:00:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:00:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319446939] [2024-11-20 04:00:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:00:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:00:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:00:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:00:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:00:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:00:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:00:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:00:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:00:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:00:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:00:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:00:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:00:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:00:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:00:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:00:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:00:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:00:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:00:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:00:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:00:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:00:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:00:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:00:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:00:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:00:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:00:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:00:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,245 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-20 04:00:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:00:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319446939] [2024-11-20 04:00:58,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319446939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:00:58,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:00:58,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:00:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703903338] [2024-11-20 04:00:58,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:00:58,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:00:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:00:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:00:58,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:00:58,254 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 04:00:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:00:58,304 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2024-11-20 04:00:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:00:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 177 [2024-11-20 04:00:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:00:58,308 INFO L225 Difference]: With dead ends: 190 [2024-11-20 04:00:58,308 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 04:00:58,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:00:58,310 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:00:58,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:00:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 04:00:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-20 04:00:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 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-20 04:00:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-20 04:00:58,331 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 177 [2024-11-20 04:00:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:00:58,334 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-20 04:00:58,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 04:00:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-20 04:00:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 04:00:58,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:00:58,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:00:58,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:00:58,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:00:58,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:00:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash -446148104, now seen corresponding path program 1 times [2024-11-20 04:00:58,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:00:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331452977] [2024-11-20 04:00:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:00:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:00:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:00:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:00:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:00:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:00:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:00:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:00:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:00:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:00:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:00:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:00:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:00:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:00:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:00:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:00:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:00:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 04:00:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 04:00:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 04:00:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 04:00:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:00:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:00:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 04:00:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 04:00:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 04:00:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 04:00:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 04:00:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:00:58,960 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-20 04:00:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:00:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331452977] [2024-11-20 04:00:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331452977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:00:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:00:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 04:00:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187590398] [2024-11-20 04:00:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:00:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:00:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:00:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:00:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:00:58,963 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-20 04:00:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:00:59,304 INFO L93 Difference]: Finished difference Result 326 states and 504 transitions. [2024-11-20 04:00:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:00:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 177 [2024-11-20 04:00:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:00:59,310 INFO L225 Difference]: With dead ends: 326 [2024-11-20 04:00:59,310 INFO L226 Difference]: Without dead ends: 232 [2024-11-20 04:00:59,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:00:59,317 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 166 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:00:59,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 616 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:00:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-20 04:00:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 189. [2024-11-20 04:00:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 134 states have (on average 1.4029850746268657) internal successors, (188), 134 states have internal predecessors, (188), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:00:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 292 transitions. [2024-11-20 04:00:59,365 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 292 transitions. Word has length 177 [2024-11-20 04:00:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:00:59,367 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 292 transitions. [2024-11-20 04:00:59,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-20 04:00:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 292 transitions. [2024-11-20 04:00:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 04:00:59,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:00:59,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:00:59,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:00:59,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:00:59,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:00:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -586696714, now seen corresponding path program 1 times [2024-11-20 04:00:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:00:59,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290068790] [2024-11-20 04:00:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:00:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:00:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat