./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-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 1759abcdcdacb11ff4424134b4ed938cccdebafbf4e21a4bd94aebb869ddee2f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:02:39,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:02:39,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:02:39,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:02:39,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:02:40,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:02:40,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:02:40,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:02:40,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:02:40,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:02:40,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:02:40,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:02:40,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:02:40,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:02:40,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:02:40,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:02:40,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:02:40,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:02:40,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:02:40,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:02:40,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:02:40,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:02:40,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:02:40,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:02:40,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:02:40,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:02:40,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:02:40,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:02:40,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:02:40,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:02:40,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:02:40,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:02:40,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:02:40,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:02:40,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:02:40,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:02:40,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:02:40,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:02:40,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:02:40,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:02:40,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:02:40,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:02:40,044 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 -> 1759abcdcdacb11ff4424134b4ed938cccdebafbf4e21a4bd94aebb869ddee2f [2024-11-19 00:02:40,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:02:40,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:02:40,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:02:40,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:02:40,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:02:40,326 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-28.i [2024-11-19 00:02:41,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:02:42,137 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:02:42,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-28.i [2024-11-19 00:02:42,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35541347c/8e88f7188c5e4b7f978a3d0afe7d6ce2/FLAG8ee0eaf88 [2024-11-19 00:02:42,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35541347c/8e88f7188c5e4b7f978a3d0afe7d6ce2 [2024-11-19 00:02:42,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:02:42,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:02:42,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:02:42,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:02:42,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:02:42,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2796e526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42, skipping insertion in model container [2024-11-19 00:02:42,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:02:42,434 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-28.i[916,929] [2024-11-19 00:02:42,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:02:42,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:02:42,741 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-28.i[916,929] [2024-11-19 00:02:42,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:02:42,927 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:02:42,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42 WrapperNode [2024-11-19 00:02:42,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:02:42,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:02:42,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:02:42,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:02:42,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:42,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,133 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 885 [2024-11-19 00:02:43,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:02:43,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:02:43,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:02:43,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:02:43,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,257 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-19 00:02:43,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:02:43,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:02:43,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:02:43,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:02:43,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (1/1) ... [2024-11-19 00:02:43,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:02:43,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:02:43,411 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-19 00:02:43,414 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-19 00:02:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:02:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:02:43,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:02:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:02:43,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:02:43,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:02:43,590 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:02:43,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:02:45,283 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-19 00:02:45,283 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:02:45,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:02:45,314 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:02:45,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:45 BoogieIcfgContainer [2024-11-19 00:02:45,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:02:45,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:02:45,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:02:45,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:02:45,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:02:42" (1/3) ... [2024-11-19 00:02:45,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1ab1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:45, skipping insertion in model container [2024-11-19 00:02:45,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:42" (2/3) ... [2024-11-19 00:02:45,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1ab1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:45, skipping insertion in model container [2024-11-19 00:02:45,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:45" (3/3) ... [2024-11-19 00:02:45,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-28.i [2024-11-19 00:02:45,343 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:02:45,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:02:45,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:02:45,429 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;@9e4a406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:02:45,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:02:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 283 states have (on average 1.530035335689046) internal successors, (433), 284 states have internal predecessors, (433), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 00:02:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-11-19 00:02:45,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:45,471 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:45,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:45,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1435351269, now seen corresponding path program 1 times [2024-11-19 00:02:45,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160878914] [2024-11-19 00:02:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2024-11-19 00:02:46,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:46,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160878914] [2024-11-19 00:02:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160878914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:02:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371275996] [2024-11-19 00:02:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:46,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:02:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:02:46,209 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-19 00:02:46,210 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-19 00:02:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:46,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:02:46,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:02:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2024-11-19 00:02:46,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:02:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371275996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:46,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:02:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:02:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958242087] [2024-11-19 00:02:46,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:46,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:02:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:02:46,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:02:46,750 INFO L87 Difference]: Start difference. First operand has 357 states, 283 states have (on average 1.530035335689046) internal successors, (433), 284 states have internal predecessors, (433), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2024-11-19 00:02:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:46,829 INFO L93 Difference]: Finished difference Result 704 states and 1211 transitions. [2024-11-19 00:02:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:02:46,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 502 [2024-11-19 00:02:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:46,868 INFO L225 Difference]: With dead ends: 704 [2024-11-19 00:02:46,868 INFO L226 Difference]: Without dead ends: 350 [2024-11-19 00:02:46,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 503 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-19 00:02:46,877 INFO L432 NwaCegarLoop]: 560 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, 560 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-19 00:02:46,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-19 00:02:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-19 00:02:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 277 states have (on average 1.5090252707581226) internal successors, (418), 277 states have internal predecessors, (418), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 00:02:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 560 transitions. [2024-11-19 00:02:46,972 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 560 transitions. Word has length 502 [2024-11-19 00:02:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:46,975 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 560 transitions. [2024-11-19 00:02:46,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2024-11-19 00:02:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 560 transitions. [2024-11-19 00:02:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-11-19 00:02:46,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:46,994 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:47,015 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-19 00:02:47,198 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-19 00:02:47,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1910963557, now seen corresponding path program 1 times [2024-11-19 00:02:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:47,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068983960] [2024-11-19 00:02:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068983960] [2024-11-19 00:02:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068983960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:47,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:47,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003674392] [2024-11-19 00:02:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:47,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:47,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:47,761 INFO L87 Difference]: Start difference. First operand 350 states and 560 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:47,863 INFO L93 Difference]: Finished difference Result 909 states and 1456 transitions. [2024-11-19 00:02:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 502 [2024-11-19 00:02:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:47,870 INFO L225 Difference]: With dead ends: 909 [2024-11-19 00:02:47,870 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 00:02:47,871 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-19 00:02:47,872 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 334 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:47,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1101 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 00:02:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 494. [2024-11-19 00:02:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 421 states have (on average 1.5629453681710215) internal successors, (658), 421 states have internal predecessors, (658), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 00:02:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 800 transitions. [2024-11-19 00:02:47,926 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 800 transitions. Word has length 502 [2024-11-19 00:02:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:47,928 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 800 transitions. [2024-11-19 00:02:47,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 800 transitions. [2024-11-19 00:02:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-11-19 00:02:47,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:47,939 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:02:47,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:47,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 424081371, now seen corresponding path program 1 times [2024-11-19 00:02:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:47,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246152966] [2024-11-19 00:02:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:47,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246152966] [2024-11-19 00:02:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246152966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:48,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371695674] [2024-11-19 00:02:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:48,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:48,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:48,392 INFO L87 Difference]: Start difference. First operand 494 states and 800 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:48,492 INFO L93 Difference]: Finished difference Result 1458 states and 2363 transitions. [2024-11-19 00:02:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 503 [2024-11-19 00:02:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:48,501 INFO L225 Difference]: With dead ends: 1458 [2024-11-19 00:02:48,501 INFO L226 Difference]: Without dead ends: 967 [2024-11-19 00:02:48,503 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-19 00:02:48,504 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 547 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:48,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1219 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-19 00:02:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 768. [2024-11-19 00:02:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 695 states have (on average 1.5856115107913669) internal successors, (1102), 695 states have internal predecessors, (1102), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 00:02:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1244 transitions. [2024-11-19 00:02:48,563 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1244 transitions. Word has length 503 [2024-11-19 00:02:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:48,565 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1244 transitions. [2024-11-19 00:02:48,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1244 transitions. [2024-11-19 00:02:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-11-19 00:02:48,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:48,578 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:48,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:02:48,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:48,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash -900774823, now seen corresponding path program 1 times [2024-11-19 00:02:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744395025] [2024-11-19 00:02:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:49,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744395025] [2024-11-19 00:02:49,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744395025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:49,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:49,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:02:49,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470777255] [2024-11-19 00:02:49,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:02:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:02:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:02:49,230 INFO L87 Difference]: Start difference. First operand 768 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:49,299 INFO L93 Difference]: Finished difference Result 1533 states and 2485 transitions. [2024-11-19 00:02:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:02:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 503 [2024-11-19 00:02:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:49,313 INFO L225 Difference]: With dead ends: 1533 [2024-11-19 00:02:49,314 INFO L226 Difference]: Without dead ends: 768 [2024-11-19 00:02:49,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-19 00:02:49,322 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:49,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1099 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:02:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-19 00:02:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2024-11-19 00:02:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 695 states have (on average 1.5798561151079136) internal successors, (1098), 695 states have internal predecessors, (1098), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 00:02:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1240 transitions. [2024-11-19 00:02:49,356 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1240 transitions. Word has length 503 [2024-11-19 00:02:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:49,360 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1240 transitions. [2024-11-19 00:02:49,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1240 transitions. [2024-11-19 00:02:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-11-19 00:02:49,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:49,372 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:49,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:02:49,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:49,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1142061517, now seen corresponding path program 1 times [2024-11-19 00:02:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:49,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312192040] [2024-11-19 00:02:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312192040] [2024-11-19 00:02:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312192040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:50,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:02:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899098550] [2024-11-19 00:02:50,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:02:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:02:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:50,152 INFO L87 Difference]: Start difference. First operand 768 states and 1240 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:50,420 INFO L93 Difference]: Finished difference Result 1537 states and 2480 transitions. [2024-11-19 00:02:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:02:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2024-11-19 00:02:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:50,428 INFO L225 Difference]: With dead ends: 1537 [2024-11-19 00:02:50,428 INFO L226 Difference]: Without dead ends: 772 [2024-11-19 00:02:50,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-19 00:02:50,431 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 377 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:50,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1707 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:02:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-19 00:02:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2024-11-19 00:02:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 698 states have (on average 1.5716332378223496) internal successors, (1097), 698 states have internal predecessors, (1097), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 00:02:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1239 transitions. [2024-11-19 00:02:50,468 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1239 transitions. Word has length 505 [2024-11-19 00:02:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:50,471 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1239 transitions. [2024-11-19 00:02:50,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1239 transitions. [2024-11-19 00:02:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-11-19 00:02:50,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:50,484 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:50,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:02:50,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1196454415, now seen corresponding path program 1 times [2024-11-19 00:02:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:50,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671445420] [2024-11-19 00:02:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671445420] [2024-11-19 00:02:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671445420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505425681] [2024-11-19 00:02:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:51,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:51,509 INFO L87 Difference]: Start difference. First operand 772 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:51,972 INFO L93 Difference]: Finished difference Result 2471 states and 3935 transitions. [2024-11-19 00:02:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:02:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2024-11-19 00:02:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:51,982 INFO L225 Difference]: With dead ends: 2471 [2024-11-19 00:02:51,983 INFO L226 Difference]: Without dead ends: 1702 [2024-11-19 00:02:51,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:51,985 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 1237 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:51,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1932 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:02:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-11-19 00:02:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1522. [2024-11-19 00:02:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1375 states have (on average 1.5629090909090908) internal successors, (2149), 1375 states have internal predecessors, (2149), 142 states have call successors, (142), 4 states have call predecessors, (142), 4 states have return successors, (142), 142 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-19 00:02:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2433 transitions. [2024-11-19 00:02:52,063 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2433 transitions. Word has length 505 [2024-11-19 00:02:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:52,066 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2433 transitions. [2024-11-19 00:02:52,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2433 transitions. [2024-11-19 00:02:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-11-19 00:02:52,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:52,075 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:02:52,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 398823529, now seen corresponding path program 1 times [2024-11-19 00:02:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102469234] [2024-11-19 00:02:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102469234] [2024-11-19 00:02:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102469234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170045477] [2024-11-19 00:02:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:52,891 INFO L87 Difference]: Start difference. First operand 1522 states and 2433 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:53,243 INFO L93 Difference]: Finished difference Result 3709 states and 5910 transitions. [2024-11-19 00:02:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2024-11-19 00:02:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:53,256 INFO L225 Difference]: With dead ends: 3709 [2024-11-19 00:02:53,256 INFO L226 Difference]: Without dead ends: 2190 [2024-11-19 00:02:53,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:53,261 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 406 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:53,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1650 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:02:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2024-11-19 00:02:53,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1659. [2024-11-19 00:02:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1439 states have (on average 1.5462126476719944) internal successors, (2225), 1439 states have internal predecessors, (2225), 213 states have call successors, (213), 6 states have call predecessors, (213), 6 states have return successors, (213), 213 states have call predecessors, (213), 213 states have call successors, (213) [2024-11-19 00:02:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2651 transitions. [2024-11-19 00:02:53,363 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2651 transitions. Word has length 505 [2024-11-19 00:02:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:53,364 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2651 transitions. [2024-11-19 00:02:53,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2651 transitions. [2024-11-19 00:02:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-11-19 00:02:53,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:53,373 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:53,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:02:53,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:53,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1202247577, now seen corresponding path program 1 times [2024-11-19 00:02:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855859099] [2024-11-19 00:02:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855859099] [2024-11-19 00:02:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855859099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:54,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:54,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621278549] [2024-11-19 00:02:54,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:54,287 INFO L87 Difference]: Start difference. First operand 1659 states and 2651 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:54,419 INFO L93 Difference]: Finished difference Result 3180 states and 5082 transitions. [2024-11-19 00:02:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:54,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 505 [2024-11-19 00:02:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:54,430 INFO L225 Difference]: With dead ends: 3180 [2024-11-19 00:02:54,430 INFO L226 Difference]: Without dead ends: 1661 [2024-11-19 00:02:54,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 00:02:54,434 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 500 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:54,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2239 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:02:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-19 00:02:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1659. [2024-11-19 00:02:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1439 states have (on average 1.542043085476025) internal successors, (2219), 1439 states have internal predecessors, (2219), 213 states have call successors, (213), 6 states have call predecessors, (213), 6 states have return successors, (213), 213 states have call predecessors, (213), 213 states have call successors, (213) [2024-11-19 00:02:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2645 transitions. [2024-11-19 00:02:54,518 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2645 transitions. Word has length 505 [2024-11-19 00:02:54,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:54,519 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2645 transitions. [2024-11-19 00:02:54,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2645 transitions. [2024-11-19 00:02:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-19 00:02:54,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:54,528 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:54,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:02:54,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash -395707700, now seen corresponding path program 1 times [2024-11-19 00:02:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925506469] [2024-11-19 00:02:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:55,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925506469] [2024-11-19 00:02:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925506469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:55,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:02:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064221072] [2024-11-19 00:02:55,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:55,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:02:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:55,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:02:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:02:55,756 INFO L87 Difference]: Start difference. First operand 1659 states and 2645 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:56,825 INFO L93 Difference]: Finished difference Result 5547 states and 8825 transitions. [2024-11-19 00:02:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:02:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 506 [2024-11-19 00:02:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:56,846 INFO L225 Difference]: With dead ends: 5547 [2024-11-19 00:02:56,846 INFO L226 Difference]: Without dead ends: 4028 [2024-11-19 00:02:56,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:02:56,852 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 726 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:56,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 2048 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:02:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2024-11-19 00:02:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3515. [2024-11-19 00:02:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 3149 states have (on average 1.551603683709114) internal successors, (4886), 3149 states have internal predecessors, (4886), 355 states have call successors, (355), 10 states have call predecessors, (355), 10 states have return successors, (355), 355 states have call predecessors, (355), 355 states have call successors, (355) [2024-11-19 00:02:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5596 transitions. [2024-11-19 00:02:57,078 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5596 transitions. Word has length 506 [2024-11-19 00:02:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:57,079 INFO L471 AbstractCegarLoop]: Abstraction has 3515 states and 5596 transitions. [2024-11-19 00:02:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5596 transitions. [2024-11-19 00:02:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-19 00:02:57,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:57,085 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:57,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:02:57,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1085848760, now seen corresponding path program 1 times [2024-11-19 00:02:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:57,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300092384] [2024-11-19 00:02:57,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:57,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:02:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:02:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:02:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:02:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300092384] [2024-11-19 00:02:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300092384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:02:58,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:02:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:02:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272177623] [2024-11-19 00:02:58,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:02:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:02:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:02:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:02:58,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:02:58,518 INFO L87 Difference]: Start difference. First operand 3515 states and 5596 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:02:59,099 INFO L93 Difference]: Finished difference Result 9319 states and 14822 transitions. [2024-11-19 00:02:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:02:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 506 [2024-11-19 00:02:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:02:59,130 INFO L225 Difference]: With dead ends: 9319 [2024-11-19 00:02:59,131 INFO L226 Difference]: Without dead ends: 5944 [2024-11-19 00:02:59,141 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-19 00:02:59,142 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 1236 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:02:59,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1564 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:02:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2024-11-19 00:02:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 5642. [2024-11-19 00:02:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5147 states have (on average 1.5558577812317855) internal successors, (8008), 5149 states have internal predecessors, (8008), 477 states have call successors, (477), 17 states have call predecessors, (477), 17 states have return successors, (477), 475 states have call predecessors, (477), 477 states have call successors, (477) [2024-11-19 00:02:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 8962 transitions. [2024-11-19 00:02:59,489 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 8962 transitions. Word has length 506 [2024-11-19 00:02:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:02:59,490 INFO L471 AbstractCegarLoop]: Abstraction has 5642 states and 8962 transitions. [2024-11-19 00:02:59,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2024-11-19 00:02:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 8962 transitions. [2024-11-19 00:02:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-19 00:02:59,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:02:59,504 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:02:59,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:02:59,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:02:59,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:02:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1023288669, now seen corresponding path program 1 times [2024-11-19 00:02:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:02:59,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306164475] [2024-11-19 00:02:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:02:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:03:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2024-11-19 00:03:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:03:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306164475] [2024-11-19 00:03:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306164475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:03:02,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:03:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:03:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740334932] [2024-11-19 00:03:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:03:02,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:03:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:03:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:03:02,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:03:02,166 INFO L87 Difference]: Start difference. First operand 5642 states and 8962 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-19 00:03:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:03:04,399 INFO L93 Difference]: Finished difference Result 13923 states and 22084 transitions. [2024-11-19 00:03:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:03:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 506 [2024-11-19 00:03:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:03:04,453 INFO L225 Difference]: With dead ends: 13923 [2024-11-19 00:03:04,453 INFO L226 Difference]: Without dead ends: 8425 [2024-11-19 00:03:04,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:03:04,469 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 1823 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:03:04,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 3457 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 00:03:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8425 states. [2024-11-19 00:03:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8425 to 5959. [2024-11-19 00:03:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5959 states, 5464 states have (on average 1.558931185944363) internal successors, (8518), 5466 states have internal predecessors, (8518), 477 states have call successors, (477), 17 states have call predecessors, (477), 17 states have return successors, (477), 475 states have call predecessors, (477), 477 states have call successors, (477) [2024-11-19 00:03:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5959 states to 5959 states and 9472 transitions. [2024-11-19 00:03:04,986 INFO L78 Accepts]: Start accepts. Automaton has 5959 states and 9472 transitions. Word has length 506 [2024-11-19 00:03:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:03:04,988 INFO L471 AbstractCegarLoop]: Abstraction has 5959 states and 9472 transitions. [2024-11-19 00:03:04,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 3 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-19 00:03:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5959 states and 9472 transitions. [2024-11-19 00:03:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-19 00:03:04,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:03:04,998 INFO L215 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:03:04,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:03:04,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:03:04,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:03:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1376377051, now seen corresponding path program 1 times [2024-11-19 00:03:04,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:03:04,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121222774] [2024-11-19 00:03:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:03:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:03:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat