./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.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 e3b150a17e2463cebe76496dbc2347bb2e3ca7c0b4d818609f62a20afc82666e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:03:43,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:03:43,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:03:43,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:03:43,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:03:44,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:03:44,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:03:44,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:03:44,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:03:44,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:03:44,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:03:44,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:03:44,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:03:44,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:03:44,014 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:03:44,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:03:44,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:03:44,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:03:44,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:03:44,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:03:44,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:03:44,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:03:44,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:03:44,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:03:44,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:03:44,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:03:44,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:03:44,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:03:44,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:03:44,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:03:44,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:03:44,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:03:44,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:03:44,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:03:44,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:03:44,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:03:44,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:03:44,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:03:44,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:03:44,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:03:44,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:03:44,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:03:44,020 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 -> e3b150a17e2463cebe76496dbc2347bb2e3ca7c0b4d818609f62a20afc82666e [2024-11-22 12:03:44,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:03:44,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:03:44,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:03:44,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:03:44,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:03:44,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.i [2024-11-22 12:03:45,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:03:45,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:03:45,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-64.i [2024-11-22 12:03:45,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03b69362/4439cc79ef874c1ead39f33476167360/FLAG90ab3a8e2 [2024-11-22 12:03:46,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03b69362/4439cc79ef874c1ead39f33476167360 [2024-11-22 12:03:46,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:03:46,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:03:46,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:03:46,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:03:46,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:03:46,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9da4bdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46, skipping insertion in model container [2024-11-22 12:03:46,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:03:46,245 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_operatoramount_amount500_file-64.i[916,929] [2024-11-22 12:03:46,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:03:46,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:03:46,449 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_operatoramount_amount500_file-64.i[916,929] [2024-11-22 12:03:46,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:03:46,561 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:03:46,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46 WrapperNode [2024-11-22 12:03:46,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:03:46,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:03:46,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:03:46,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:03:46,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,769 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 704 [2024-11-22 12:03:46,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:03:46,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:03:46,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:03:46,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:03:46,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,871 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-22 12:03:46,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:03:46,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:03:46,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:03:46,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:03:46,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (1/1) ... [2024-11-22 12:03:46,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:03:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:03:46,983 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-22 12:03:46,985 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-22 12:03:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:03:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:03:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:03:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:03:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:03:47,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:03:47,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:03:47,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:03:48,068 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-22 12:03:48,068 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:03:48,088 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:03:48,089 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:03:48,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:03:48 BoogieIcfgContainer [2024-11-22 12:03:48,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:03:48,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:03:48,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:03:48,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:03:48,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:03:46" (1/3) ... [2024-11-22 12:03:48,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd258a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:03:48, skipping insertion in model container [2024-11-22 12:03:48,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:03:46" (2/3) ... [2024-11-22 12:03:48,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd258a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:03:48, skipping insertion in model container [2024-11-22 12:03:48,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:03:48" (3/3) ... [2024-11-22 12:03:48,098 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-64.i [2024-11-22 12:03:48,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:03:48,111 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:03:48,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:03:48,179 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;@106755ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:03:48,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:03:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 208 states have internal predecessors, (327), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-22 12:03:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-22 12:03:48,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:48,214 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:48,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:48,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1076782971, now seen corresponding path program 1 times [2024-11-22 12:03:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287401279] [2024-11-22 12:03:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2024-11-22 12:03:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:48,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287401279] [2024-11-22 12:03:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287401279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:03:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866132768] [2024-11-22 12:03:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:48,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:03:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:03:48,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:03:48,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:03:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:49,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:03:49,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:03:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2024-11-22 12:03:49,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:03:49,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866132768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:49,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:03:49,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:03:49,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481786008] [2024-11-22 12:03:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:49,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:03:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:03:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:03:49,109 INFO L87 Difference]: Start difference. First operand has 275 states, 207 states have (on average 1.5797101449275361) internal successors, (327), 208 states have internal predecessors, (327), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-22 12:03:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:49,161 INFO L93 Difference]: Finished difference Result 541 states and 969 transitions. [2024-11-22 12:03:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:03:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 434 [2024-11-22 12:03:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:49,172 INFO L225 Difference]: With dead ends: 541 [2024-11-22 12:03:49,172 INFO L226 Difference]: Without dead ends: 269 [2024-11-22 12:03:49,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 435 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-22 12:03:49,182 INFO L432 NwaCegarLoop]: 444 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, 444 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-22 12:03:49,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:03:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-22 12:03:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-22 12:03:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 202 states have (on average 1.5544554455445545) internal successors, (314), 202 states have internal predecessors, (314), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-22 12:03:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 444 transitions. [2024-11-22 12:03:49,253 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 444 transitions. Word has length 434 [2024-11-22 12:03:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:49,254 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 444 transitions. [2024-11-22 12:03:49,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-22 12:03:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 444 transitions. [2024-11-22 12:03:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-22 12:03:49,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:49,266 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:49,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:03:49,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:03:49,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1809940997, now seen corresponding path program 1 times [2024-11-22 12:03:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204010286] [2024-11-22 12:03:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:03:49,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:49,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204010286] [2024-11-22 12:03:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204010286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:03:49,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:03:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008728079] [2024-11-22 12:03:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:03:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:49,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:03:49,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:03:49,819 INFO L87 Difference]: Start difference. First operand 269 states and 444 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:49,922 INFO L93 Difference]: Finished difference Result 739 states and 1223 transitions. [2024-11-22 12:03:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:03:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2024-11-22 12:03:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:49,930 INFO L225 Difference]: With dead ends: 739 [2024-11-22 12:03:49,932 INFO L226 Difference]: Without dead ends: 473 [2024-11-22 12:03:49,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 12:03:49,935 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 326 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:03:49,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 853 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:03:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-22 12:03:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 470. [2024-11-22 12:03:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 376 states have (on average 1.5824468085106382) internal successors, (595), 377 states have internal predecessors, (595), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-22 12:03:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 777 transitions. [2024-11-22 12:03:49,985 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 777 transitions. Word has length 434 [2024-11-22 12:03:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:49,986 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 777 transitions. [2024-11-22 12:03:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 777 transitions. [2024-11-22 12:03:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-22 12:03:49,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:49,993 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:03:49,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1224109049, now seen corresponding path program 1 times [2024-11-22 12:03:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:49,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588034679] [2024-11-22 12:03:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:03:50,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:50,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588034679] [2024-11-22 12:03:50,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588034679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:03:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:03:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318020991] [2024-11-22 12:03:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:50,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:03:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:03:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:03:50,295 INFO L87 Difference]: Start difference. First operand 470 states and 777 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:50,404 INFO L93 Difference]: Finished difference Result 1354 states and 2246 transitions. [2024-11-22 12:03:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:03:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2024-11-22 12:03:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:50,417 INFO L225 Difference]: With dead ends: 1354 [2024-11-22 12:03:50,417 INFO L226 Difference]: Without dead ends: 887 [2024-11-22 12:03:50,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 12:03:50,419 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 391 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:03:50,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1075 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:03:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-22 12:03:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 532. [2024-11-22 12:03:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 438 states have (on average 1.6050228310502284) internal successors, (703), 439 states have internal predecessors, (703), 91 states have call successors, (91), 2 states have call predecessors, (91), 2 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-22 12:03:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 885 transitions. [2024-11-22 12:03:50,466 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 885 transitions. Word has length 434 [2024-11-22 12:03:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:50,467 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 885 transitions. [2024-11-22 12:03:50,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 885 transitions. [2024-11-22 12:03:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-22 12:03:50,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:50,471 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:50,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 12:03:50,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:50,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:50,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1225491081, now seen corresponding path program 1 times [2024-11-22 12:03:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454911550] [2024-11-22 12:03:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:03:50,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:50,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454911550] [2024-11-22 12:03:50,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454911550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:50,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:03:50,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:03:50,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950151443] [2024-11-22 12:03:50,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:03:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:50,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:03:50,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:03:50,798 INFO L87 Difference]: Start difference. First operand 532 states and 885 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:50,848 INFO L93 Difference]: Finished difference Result 1455 states and 2418 transitions. [2024-11-22 12:03:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:03:50,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2024-11-22 12:03:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:50,854 INFO L225 Difference]: With dead ends: 1455 [2024-11-22 12:03:50,854 INFO L226 Difference]: Without dead ends: 926 [2024-11-22 12:03:50,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 12:03:50,856 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 245 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:03:50,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 958 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:03:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-22 12:03:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 922. [2024-11-22 12:03:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 782 states have (on average 1.6125319693094629) internal successors, (1261), 785 states have internal predecessors, (1261), 135 states have call successors, (135), 4 states have call predecessors, (135), 4 states have return successors, (135), 132 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-22 12:03:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1531 transitions. [2024-11-22 12:03:50,906 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1531 transitions. Word has length 434 [2024-11-22 12:03:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:50,906 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1531 transitions. [2024-11-22 12:03:50,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1531 transitions. [2024-11-22 12:03:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-22 12:03:50,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:50,912 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:50,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:03:50,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:50,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 781590407, now seen corresponding path program 1 times [2024-11-22 12:03:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066372391] [2024-11-22 12:03:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:03:52,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:52,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066372391] [2024-11-22 12:03:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066372391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:03:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:03:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021162233] [2024-11-22 12:03:52,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:52,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:03:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:03:52,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:03:52,064 INFO L87 Difference]: Start difference. First operand 922 states and 1531 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:52,441 INFO L93 Difference]: Finished difference Result 2646 states and 4404 transitions. [2024-11-22 12:03:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:03:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 434 [2024-11-22 12:03:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:52,450 INFO L225 Difference]: With dead ends: 2646 [2024-11-22 12:03:52,450 INFO L226 Difference]: Without dead ends: 1727 [2024-11-22 12:03:52,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:03:52,453 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 351 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:03:52,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1284 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:03:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-11-22 12:03:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1621. [2024-11-22 12:03:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1413 states have (on average 1.6383581033262562) internal successors, (2315), 1416 states have internal predecessors, (2315), 200 states have call successors, (200), 7 states have call predecessors, (200), 7 states have return successors, (200), 197 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-22 12:03:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2715 transitions. [2024-11-22 12:03:52,530 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2715 transitions. Word has length 434 [2024-11-22 12:03:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:52,531 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 2715 transitions. [2024-11-22 12:03:52,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2715 transitions. [2024-11-22 12:03:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-11-22 12:03:52,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:52,535 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:52,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:03:52,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:52,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -128195510, now seen corresponding path program 1 times [2024-11-22 12:03:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305928895] [2024-11-22 12:03:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:03:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305928895] [2024-11-22 12:03:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305928895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:03:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:03:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040725177] [2024-11-22 12:03:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:54,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:03:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:03:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:03:54,069 INFO L87 Difference]: Start difference. First operand 1621 states and 2715 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:54,649 INFO L93 Difference]: Finished difference Result 3957 states and 6654 transitions. [2024-11-22 12:03:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:03:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 436 [2024-11-22 12:03:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:54,660 INFO L225 Difference]: With dead ends: 3957 [2024-11-22 12:03:54,661 INFO L226 Difference]: Without dead ends: 2831 [2024-11-22 12:03:54,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:03:54,664 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 2055 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:03:54,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1395 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:03:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2024-11-22 12:03:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 1951. [2024-11-22 12:03:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1743 states have (on average 1.6230636833046472) internal successors, (2829), 1746 states have internal predecessors, (2829), 200 states have call successors, (200), 7 states have call predecessors, (200), 7 states have return successors, (200), 197 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-22 12:03:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3229 transitions. [2024-11-22 12:03:54,737 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3229 transitions. Word has length 436 [2024-11-22 12:03:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3229 transitions. [2024-11-22 12:03:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3229 transitions. [2024-11-22 12:03:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-11-22 12:03:54,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:54,743 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:54,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:03:54,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:54,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash 765963726, now seen corresponding path program 1 times [2024-11-22 12:03:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044291263] [2024-11-22 12:03:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:03:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:03:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:03:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044291263] [2024-11-22 12:03:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044291263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:03:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:03:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:03:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471945142] [2024-11-22 12:03:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:03:55,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:03:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:03:55,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:03:55,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:03:55,851 INFO L87 Difference]: Start difference. First operand 1951 states and 3229 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:03:56,387 INFO L93 Difference]: Finished difference Result 5597 states and 9310 transitions. [2024-11-22 12:03:56,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:03:56,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 436 [2024-11-22 12:03:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:03:56,406 INFO L225 Difference]: With dead ends: 5597 [2024-11-22 12:03:56,406 INFO L226 Difference]: Without dead ends: 4351 [2024-11-22 12:03:56,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:03:56,412 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 949 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 12:03:56,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1389 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 12:03:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2024-11-22 12:03:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 3390. [2024-11-22 12:03:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3064 states have (on average 1.6546997389033942) internal successors, (5070), 3071 states have internal predecessors, (5070), 314 states have call successors, (314), 11 states have call predecessors, (314), 11 states have return successors, (314), 307 states have call predecessors, (314), 314 states have call successors, (314) [2024-11-22 12:03:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 5698 transitions. [2024-11-22 12:03:56,551 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 5698 transitions. Word has length 436 [2024-11-22 12:03:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:03:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 3390 states and 5698 transitions. [2024-11-22 12:03:56,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-22 12:03:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 5698 transitions. [2024-11-22 12:03:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-11-22 12:03:56,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:03:56,558 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:03:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 12:03:56,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:03:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:03:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1189610448, now seen corresponding path program 1 times [2024-11-22 12:03:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:03:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051981301] [2024-11-22 12:03:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:03:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:03:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:04:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-22 12:04:28,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:04:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051981301] [2024-11-22 12:04:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051981301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:04:28,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:04:28,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-22 12:04:28,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208423905] [2024-11-22 12:04:28,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:04:28,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 12:04:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:04:28,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 12:04:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2024-11-22 12:04:28,918 INFO L87 Difference]: Start difference. First operand 3390 states and 5698 transitions. Second operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 7 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 7 states have call predecessors, (65), 7 states have call successors, (65) [2024-11-22 12:04:41,849 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 330 DAG size of output: 243 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 12:04:52,354 WARN L286 SmtUtils]: Spent 9.96s on a formula simplification. DAG size of input: 334 DAG size of output: 247 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 12:04:58,579 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 328 DAG size of output: 230 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 12:05:07,923 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 359 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)