./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:55:34,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:55:34,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:55:34,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:55:34,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:55:34,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:55:34,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:55:34,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:55:34,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:55:34,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:55:34,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:55:34,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:55:34,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:55:34,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:55:34,482 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:55:34,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:55:34,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:55:34,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:55:34,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:55:34,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:55:34,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:55:34,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:55:34,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:55:34,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:55:34,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:55:34,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:55:34,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:55:34,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:55:34,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:55:34,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:55:34,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:55:34,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:55:34,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:55:34,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:55:34,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:55:34,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:55:34,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:55:34,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:55:34,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:55:34,490 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2024-10-11 06:55:34,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:55:34,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:55:34,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:55:34,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:55:34,698 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:55:34,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-10-11 06:55:35,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:55:36,086 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:55:36,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-10-11 06:55:36,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4d966102/c7ce9bcfd8a346f8a6ba886d289a1336/FLAG92edec9b5 [2024-10-11 06:55:36,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4d966102/c7ce9bcfd8a346f8a6ba886d289a1336 [2024-10-11 06:55:36,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:55:36,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:55:36,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:55:36,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:55:36,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:55:36,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:36,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a99e69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36, skipping insertion in model container [2024-10-11 06:55:36,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:36,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:55:36,634 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-10-11 06:55:36,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:55:36,828 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:55:36,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-10-11 06:55:36,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:55:36,952 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:55:36,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36 WrapperNode [2024-10-11 06:55:36,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:55:36,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:55:36,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:55:36,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:55:36,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:36,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,082 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1372 [2024-10-11 06:55:37,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:55:37,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:55:37,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:55:37,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:55:37,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,168 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-10-11 06:55:37,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:55:37,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:55:37,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:55:37,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:55:37,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (1/1) ... [2024-10-11 06:55:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:55:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:55:37,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:55:37,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:55:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:55:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:55:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:55:37,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:55:37,472 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:55:37,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:55:39,031 INFO L? ?]: Removed 948 outVars from TransFormulas that were not future-live. [2024-10-11 06:55:39,032 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:55:39,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:55:39,072 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:55:39,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:55:39 BoogieIcfgContainer [2024-10-11 06:55:39,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:55:39,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:55:39,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:55:39,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:55:39,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:55:36" (1/3) ... [2024-10-11 06:55:39,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d1961a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:55:39, skipping insertion in model container [2024-10-11 06:55:39,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:55:36" (2/3) ... [2024-10-11 06:55:39,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d1961a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:55:39, skipping insertion in model container [2024-10-11 06:55:39,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:55:39" (3/3) ... [2024-10-11 06:55:39,082 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2024-10-11 06:55:39,095 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:55:39,096 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:55:39,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:55:39,156 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;@75f75d49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:55:39,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:55:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 241 states have (on average 1.5020746887966805) internal successors, (362), 242 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 06:55:39,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:39,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:39,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1813765921, now seen corresponding path program 1 times [2024-10-11 06:55:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:39,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670919215] [2024-10-11 06:55:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:39,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:39,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670919215] [2024-10-11 06:55:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670919215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:39,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:55:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693918681] [2024-10-11 06:55:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:55:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:55:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:55:39,887 INFO L87 Difference]: Start difference. First operand has 243 states, 241 states have (on average 1.5020746887966805) internal successors, (362), 242 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:39,953 INFO L93 Difference]: Finished difference Result 422 states and 630 transitions. [2024-10-11 06:55:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:55:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-11 06:55:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:39,968 INFO L225 Difference]: With dead ends: 422 [2024-10-11 06:55:39,968 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 06:55:39,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:55:39,973 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 0 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:39,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1066 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:55:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 06:55:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-10-11 06:55:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2024-10-11 06:55:40,008 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 74 [2024-10-11 06:55:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:40,009 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2024-10-11 06:55:40,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2024-10-11 06:55:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 06:55:40,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:40,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:40,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:55:40,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:40,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -390473095, now seen corresponding path program 1 times [2024-10-11 06:55:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:40,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854973548] [2024-10-11 06:55:40,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854973548] [2024-10-11 06:55:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854973548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:40,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:40,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:55:40,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254965887] [2024-10-11 06:55:40,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:40,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:55:40,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:40,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:55:40,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:55:40,273 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:40,308 INFO L93 Difference]: Finished difference Result 425 states and 630 transitions. [2024-10-11 06:55:40,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:55:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 06:55:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:40,311 INFO L225 Difference]: With dead ends: 425 [2024-10-11 06:55:40,311 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 06:55:40,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:55:40,314 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 0 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:40,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1063 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:55:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 06:55:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-11 06:55:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.4857142857142858) internal successors, (364), 245 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 364 transitions. [2024-10-11 06:55:40,333 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 364 transitions. Word has length 75 [2024-10-11 06:55:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:40,334 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 364 transitions. [2024-10-11 06:55:40,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 364 transitions. [2024-10-11 06:55:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 06:55:40,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:40,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:40,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:55:40,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:40,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -317729544, now seen corresponding path program 1 times [2024-10-11 06:55:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:40,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784245182] [2024-10-11 06:55:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:40,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784245182] [2024-10-11 06:55:40,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784245182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:40,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:40,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:55:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324021153] [2024-10-11 06:55:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:40,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:55:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:55:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:55:40,647 INFO L87 Difference]: Start difference. First operand 246 states and 364 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:40,705 INFO L93 Difference]: Finished difference Result 431 states and 637 transitions. [2024-10-11 06:55:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:55:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 06:55:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:40,707 INFO L225 Difference]: With dead ends: 431 [2024-10-11 06:55:40,707 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 06:55:40,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:55:40,709 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 298 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:40,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1044 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:55:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 06:55:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2024-10-11 06:55:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4798387096774193) internal successors, (367), 248 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 367 transitions. [2024-10-11 06:55:40,716 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 367 transitions. Word has length 76 [2024-10-11 06:55:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:40,716 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 367 transitions. [2024-10-11 06:55:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 367 transitions. [2024-10-11 06:55:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 06:55:40,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:40,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:40,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:55:40,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:40,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash 304864284, now seen corresponding path program 1 times [2024-10-11 06:55:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:40,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857513276] [2024-10-11 06:55:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857513276] [2024-10-11 06:55:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857513276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:55:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238769768] [2024-10-11 06:55:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:55:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:41,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:55:41,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:55:41,427 INFO L87 Difference]: Start difference. First operand 249 states and 367 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:42,453 INFO L93 Difference]: Finished difference Result 524 states and 768 transitions. [2024-10-11 06:55:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:55:42,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-11 06:55:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:42,456 INFO L225 Difference]: With dead ends: 524 [2024-10-11 06:55:42,456 INFO L226 Difference]: Without dead ends: 340 [2024-10-11 06:55:42,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:55:42,463 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 547 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:42,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1031 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 06:55:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-11 06:55:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 276. [2024-10-11 06:55:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.4763636363636363) internal successors, (406), 275 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 406 transitions. [2024-10-11 06:55:42,472 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 406 transitions. Word has length 77 [2024-10-11 06:55:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:42,472 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 406 transitions. [2024-10-11 06:55:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 406 transitions. [2024-10-11 06:55:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 06:55:42,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:42,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:55:42,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:42,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1382178542, now seen corresponding path program 1 times [2024-10-11 06:55:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783149073] [2024-10-11 06:55:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783149073] [2024-10-11 06:55:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783149073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:55:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352521565] [2024-10-11 06:55:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:43,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:55:43,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:55:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:55:43,234 INFO L87 Difference]: Start difference. First operand 276 states and 406 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:46,702 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2024-10-11 06:55:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:55:46,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 06:55:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:46,709 INFO L225 Difference]: With dead ends: 528 [2024-10-11 06:55:46,709 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 06:55:46,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:55:46,710 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 443 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:46,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 2346 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 06:55:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 06:55:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 280. [2024-10-11 06:55:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.4731182795698925) internal successors, (411), 279 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 411 transitions. [2024-10-11 06:55:46,716 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 411 transitions. Word has length 78 [2024-10-11 06:55:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:46,716 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 411 transitions. [2024-10-11 06:55:46,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2024-10-11 06:55:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:55:46,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:46,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:55:46,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -487126934, now seen corresponding path program 1 times [2024-10-11 06:55:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624760614] [2024-10-11 06:55:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:47,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624760614] [2024-10-11 06:55:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624760614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:47,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:47,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 06:55:47,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973057802] [2024-10-11 06:55:47,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:47,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 06:55:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 06:55:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 06:55:47,381 INFO L87 Difference]: Start difference. First operand 280 states and 411 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:48,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:55:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:50,103 INFO L93 Difference]: Finished difference Result 525 states and 767 transitions. [2024-10-11 06:55:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:55:50,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-11 06:55:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:50,105 INFO L225 Difference]: With dead ends: 525 [2024-10-11 06:55:50,106 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 06:55:50,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-11 06:55:50,109 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 555 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:50,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 2019 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 06:55:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 06:55:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 279. [2024-10-11 06:55:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4712230215827338) internal successors, (409), 278 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 409 transitions. [2024-10-11 06:55:50,114 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 409 transitions. Word has length 79 [2024-10-11 06:55:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:50,114 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 409 transitions. [2024-10-11 06:55:50,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 409 transitions. [2024-10-11 06:55:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 06:55:50,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:50,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:55:50,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1125544067, now seen corresponding path program 1 times [2024-10-11 06:55:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508966065] [2024-10-11 06:55:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:50,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:50,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:50,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508966065] [2024-10-11 06:55:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508966065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:50,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:55:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541654366] [2024-10-11 06:55:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:50,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:55:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:50,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:55:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:55:50,358 INFO L87 Difference]: Start difference. First operand 279 states and 409 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:50,407 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2024-10-11 06:55:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:55:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-11 06:55:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:50,408 INFO L225 Difference]: With dead ends: 472 [2024-10-11 06:55:50,408 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 06:55:50,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:55:50,410 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 7 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:50,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1752 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:55:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 06:55:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2024-10-11 06:55:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.469964664310954) internal successors, (416), 283 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 416 transitions. [2024-10-11 06:55:50,416 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 416 transitions. Word has length 79 [2024-10-11 06:55:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:50,417 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 416 transitions. [2024-10-11 06:55:50,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 416 transitions. [2024-10-11 06:55:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 06:55:50,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:50,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:50,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:55:50,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:50,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:50,419 INFO L85 PathProgramCache]: Analyzing trace with hash 147138933, now seen corresponding path program 1 times [2024-10-11 06:55:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:50,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176779532] [2024-10-11 06:55:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:50,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176779532] [2024-10-11 06:55:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176779532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:55:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038234466] [2024-10-11 06:55:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:50,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:55:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:55:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:55:50,881 INFO L87 Difference]: Start difference. First operand 284 states and 416 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:52,294 INFO L93 Difference]: Finished difference Result 541 states and 788 transitions. [2024-10-11 06:55:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:55:52,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-11 06:55:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:52,296 INFO L225 Difference]: With dead ends: 541 [2024-10-11 06:55:52,296 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 06:55:52,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:55:52,296 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 547 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:52,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2112 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 06:55:52,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 06:55:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 292. [2024-10-11 06:55:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4673539518900343) internal successors, (427), 291 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 427 transitions. [2024-10-11 06:55:52,301 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 427 transitions. Word has length 80 [2024-10-11 06:55:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:52,301 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 427 transitions. [2024-10-11 06:55:52,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 427 transitions. [2024-10-11 06:55:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:55:52,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:52,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:52,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:55:52,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:52,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1001416751, now seen corresponding path program 1 times [2024-10-11 06:55:52,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:52,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821218546] [2024-10-11 06:55:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821218546] [2024-10-11 06:55:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821218546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:55:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818020012] [2024-10-11 06:55:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:55:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:55:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:55:52,659 INFO L87 Difference]: Start difference. First operand 292 states and 427 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:54,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:55:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:55,003 INFO L93 Difference]: Finished difference Result 541 states and 787 transitions. [2024-10-11 06:55:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:55:55,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 06:55:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:55,005 INFO L225 Difference]: With dead ends: 541 [2024-10-11 06:55:55,005 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 06:55:55,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:55:55,006 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 543 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:55,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1704 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 06:55:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 06:55:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 298. [2024-10-11 06:55:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4545454545454546) internal successors, (432), 297 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 432 transitions. [2024-10-11 06:55:55,014 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 432 transitions. Word has length 81 [2024-10-11 06:55:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 432 transitions. [2024-10-11 06:55:55,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 432 transitions. [2024-10-11 06:55:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 06:55:55,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:55,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 06:55:55,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:55,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1528774394, now seen corresponding path program 1 times [2024-10-11 06:55:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43305874] [2024-10-11 06:55:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43305874] [2024-10-11 06:55:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43305874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:55,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:55:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117546344] [2024-10-11 06:55:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:55,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:55:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:55:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:55:55,540 INFO L87 Difference]: Start difference. First operand 298 states and 432 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:57,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:55:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:55:57,542 INFO L93 Difference]: Finished difference Result 539 states and 781 transitions. [2024-10-11 06:55:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:55:57,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 06:55:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:55:57,544 INFO L225 Difference]: With dead ends: 539 [2024-10-11 06:55:57,544 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 06:55:57,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:55:57,545 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 513 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:55:57,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1031 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 06:55:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 06:55:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 296. [2024-10-11 06:55:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4542372881355932) internal successors, (429), 295 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 429 transitions. [2024-10-11 06:55:57,550 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 429 transitions. Word has length 81 [2024-10-11 06:55:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:55:57,551 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 429 transitions. [2024-10-11 06:55:57,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 429 transitions. [2024-10-11 06:55:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 06:55:57,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:55:57,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:55:57,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 06:55:57,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:55:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:55:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1652370300, now seen corresponding path program 1 times [2024-10-11 06:55:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:55:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819321392] [2024-10-11 06:55:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:55:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:55:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:55:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:55:58,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:55:58,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819321392] [2024-10-11 06:55:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819321392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:55:58,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:55:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:55:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352851651] [2024-10-11 06:55:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:55:58,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:55:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:55:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:55:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:55:58,014 INFO L87 Difference]: Start difference. First operand 296 states and 429 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:55:59,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:56:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:00,396 INFO L93 Difference]: Finished difference Result 553 states and 802 transitions. [2024-10-11 06:56:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:56:00,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 06:56:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:00,397 INFO L225 Difference]: With dead ends: 553 [2024-10-11 06:56:00,397 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 06:56:00,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:56:00,398 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 443 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:00,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 2120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 06:56:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 06:56:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 304. [2024-10-11 06:56:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4554455445544554) internal successors, (441), 303 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 441 transitions. [2024-10-11 06:56:00,403 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 441 transitions. Word has length 82 [2024-10-11 06:56:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:00,404 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 441 transitions. [2024-10-11 06:56:00,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 441 transitions. [2024-10-11 06:56:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 06:56:00,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:00,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 06:56:00,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:00,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1150791943, now seen corresponding path program 1 times [2024-10-11 06:56:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349802764] [2024-10-11 06:56:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349802764] [2024-10-11 06:56:00,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349802764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:56:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367740540] [2024-10-11 06:56:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:00,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:56:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:56:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:56:00,897 INFO L87 Difference]: Start difference. First operand 304 states and 441 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:00,966 INFO L93 Difference]: Finished difference Result 501 states and 730 transitions. [2024-10-11 06:56:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:56:00,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 06:56:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:00,967 INFO L225 Difference]: With dead ends: 501 [2024-10-11 06:56:00,967 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 06:56:00,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:56:00,968 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 2 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:00,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2086 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:56:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 06:56:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2024-10-11 06:56:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4563758389261745) internal successors, (434), 298 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 434 transitions. [2024-10-11 06:56:00,972 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 434 transitions. Word has length 82 [2024-10-11 06:56:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:00,972 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 434 transitions. [2024-10-11 06:56:00,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 434 transitions. [2024-10-11 06:56:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 06:56:00,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:00,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:00,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 06:56:00,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:00,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1198221640, now seen corresponding path program 1 times [2024-10-11 06:56:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:00,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714006572] [2024-10-11 06:56:00,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714006572] [2024-10-11 06:56:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714006572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:56:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888592986] [2024-10-11 06:56:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:01,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:56:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:56:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:56:01,501 INFO L87 Difference]: Start difference. First operand 299 states and 434 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:03,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:56:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:03,569 INFO L93 Difference]: Finished difference Result 548 states and 793 transitions. [2024-10-11 06:56:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:56:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-11 06:56:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:03,571 INFO L225 Difference]: With dead ends: 548 [2024-10-11 06:56:03,571 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 06:56:03,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:56:03,572 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 520 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:03,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1029 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 06:56:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 06:56:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 302. [2024-10-11 06:56:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 436 transitions. [2024-10-11 06:56:03,577 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 436 transitions. Word has length 83 [2024-10-11 06:56:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 436 transitions. [2024-10-11 06:56:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2024-10-11 06:56:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 06:56:03,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:03,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:03,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 06:56:03,579 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:03,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1410016515, now seen corresponding path program 1 times [2024-10-11 06:56:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:03,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105203140] [2024-10-11 06:56:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:04,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105203140] [2024-10-11 06:56:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105203140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:04,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:04,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:56:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762784191] [2024-10-11 06:56:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:04,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:56:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:04,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:56:04,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:56:04,029 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:08,285 INFO L93 Difference]: Finished difference Result 554 states and 801 transitions. [2024-10-11 06:56:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:56:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 06:56:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:08,287 INFO L225 Difference]: With dead ends: 554 [2024-10-11 06:56:08,288 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 06:56:08,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:56:08,289 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 531 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:08,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 2346 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 06:56:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 06:56:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 312. [2024-10-11 06:56:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.45016077170418) internal successors, (451), 311 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 451 transitions. [2024-10-11 06:56:08,293 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 451 transitions. Word has length 84 [2024-10-11 06:56:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:08,294 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 451 transitions. [2024-10-11 06:56:08,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 451 transitions. [2024-10-11 06:56:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 06:56:08,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:08,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:08,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 06:56:08,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:08,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1117284705, now seen corresponding path program 1 times [2024-10-11 06:56:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115944278] [2024-10-11 06:56:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115944278] [2024-10-11 06:56:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115944278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:56:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818316605] [2024-10-11 06:56:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:56:08,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:08,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:56:08,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:56:08,664 INFO L87 Difference]: Start difference. First operand 312 states and 451 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:08,735 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2024-10-11 06:56:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:56:08,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 06:56:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:08,737 INFO L225 Difference]: With dead ends: 514 [2024-10-11 06:56:08,737 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 06:56:08,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:56:08,738 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 3 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:08,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2409 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:56:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 06:56:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2024-10-11 06:56:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4465408805031446) internal successors, (460), 318 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 460 transitions. [2024-10-11 06:56:08,744 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 460 transitions. Word has length 84 [2024-10-11 06:56:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:08,744 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 460 transitions. [2024-10-11 06:56:08,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 460 transitions. [2024-10-11 06:56:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 06:56:08,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:08,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 06:56:08,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:08,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1805283584, now seen corresponding path program 1 times [2024-10-11 06:56:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112927273] [2024-10-11 06:56:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112927273] [2024-10-11 06:56:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112927273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:09,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 06:56:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576033565] [2024-10-11 06:56:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:09,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 06:56:09,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 06:56:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:56:09,313 INFO L87 Difference]: Start difference. First operand 319 states and 460 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:09,462 INFO L93 Difference]: Finished difference Result 532 states and 772 transitions. [2024-10-11 06:56:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 06:56:09,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 06:56:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:09,463 INFO L225 Difference]: With dead ends: 532 [2024-10-11 06:56:09,463 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 06:56:09,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:56:09,464 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 5 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:09,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3442 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:56:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 06:56:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2024-10-11 06:56:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.45) internal successors, (464), 320 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 464 transitions. [2024-10-11 06:56:09,470 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 464 transitions. Word has length 84 [2024-10-11 06:56:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:09,470 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 464 transitions. [2024-10-11 06:56:09,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 464 transitions. [2024-10-11 06:56:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 06:56:09,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:09,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:09,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 06:56:09,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -883899105, now seen corresponding path program 1 times [2024-10-11 06:56:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796710253] [2024-10-11 06:56:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796710253] [2024-10-11 06:56:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796710253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 06:56:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752059359] [2024-10-11 06:56:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:09,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 06:56:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:09,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 06:56:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:56:09,846 INFO L87 Difference]: Start difference. First operand 321 states and 464 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:12,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:56:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:12,645 INFO L93 Difference]: Finished difference Result 578 states and 835 transitions. [2024-10-11 06:56:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 06:56:12,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 06:56:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:12,646 INFO L225 Difference]: With dead ends: 578 [2024-10-11 06:56:12,647 INFO L226 Difference]: Without dead ends: 371 [2024-10-11 06:56:12,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 06:56:12,647 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 535 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:12,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1704 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 06:56:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-11 06:56:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 327. [2024-10-11 06:56:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.4386503067484662) internal successors, (469), 326 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 469 transitions. [2024-10-11 06:56:12,652 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 469 transitions. Word has length 85 [2024-10-11 06:56:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:12,653 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 469 transitions. [2024-10-11 06:56:12,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 469 transitions. [2024-10-11 06:56:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 06:56:12,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:12,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 06:56:12,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:12,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1640297300, now seen corresponding path program 1 times [2024-10-11 06:56:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644029087] [2024-10-11 06:56:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644029087] [2024-10-11 06:56:13,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644029087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:13,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:13,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 06:56:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777647108] [2024-10-11 06:56:13,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:13,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 06:56:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 06:56:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:56:13,226 INFO L87 Difference]: Start difference. First operand 327 states and 469 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:13,423 INFO L93 Difference]: Finished difference Result 567 states and 818 transitions. [2024-10-11 06:56:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 06:56:13,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 06:56:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:13,424 INFO L225 Difference]: With dead ends: 567 [2024-10-11 06:56:13,424 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 06:56:13,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 06:56:13,425 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 11 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:13,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4463 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:56:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 06:56:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2024-10-11 06:56:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.4375) internal successors, (506), 352 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 506 transitions. [2024-10-11 06:56:13,429 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 506 transitions. Word has length 85 [2024-10-11 06:56:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:13,430 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 506 transitions. [2024-10-11 06:56:13,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 506 transitions. [2024-10-11 06:56:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 06:56:13,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:13,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:13,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 06:56:13,431 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:13,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 101701130, now seen corresponding path program 1 times [2024-10-11 06:56:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974666322] [2024-10-11 06:56:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:13,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974666322] [2024-10-11 06:56:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974666322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:56:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333188793] [2024-10-11 06:56:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 06:56:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 06:56:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:56:13,884 INFO L87 Difference]: Start difference. First operand 353 states and 506 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:15,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:56:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:17,173 INFO L93 Difference]: Finished difference Result 641 states and 924 transitions. [2024-10-11 06:56:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 06:56:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 06:56:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:17,175 INFO L225 Difference]: With dead ends: 641 [2024-10-11 06:56:17,175 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 06:56:17,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 06:56:17,176 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 533 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:17,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2117 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 06:56:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 06:56:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 360. [2024-10-11 06:56:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4373259052924792) internal successors, (516), 359 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 516 transitions. [2024-10-11 06:56:17,181 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 516 transitions. Word has length 86 [2024-10-11 06:56:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:17,181 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 516 transitions. [2024-10-11 06:56:17,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 516 transitions. [2024-10-11 06:56:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 06:56:17,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:17,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 06:56:17,182 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:17,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash -553957170, now seen corresponding path program 1 times [2024-10-11 06:56:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:17,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905113233] [2024-10-11 06:56:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:17,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905113233] [2024-10-11 06:56:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905113233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 06:56:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597604717] [2024-10-11 06:56:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:17,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 06:56:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 06:56:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-10-11 06:56:17,760 INFO L87 Difference]: Start difference. First operand 360 states and 516 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:18,282 INFO L93 Difference]: Finished difference Result 631 states and 913 transitions. [2024-10-11 06:56:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 06:56:18,283 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 06:56:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:18,284 INFO L225 Difference]: With dead ends: 631 [2024-10-11 06:56:18,284 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 06:56:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-11 06:56:18,286 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 349 mSDsluCounter, 5682 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 5999 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:18,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 5999 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 06:56:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 06:56:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2024-10-11 06:56:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.4396984924623115) internal successors, (573), 398 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 573 transitions. [2024-10-11 06:56:18,293 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 573 transitions. Word has length 86 [2024-10-11 06:56:18,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:18,293 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 573 transitions. [2024-10-11 06:56:18,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 573 transitions. [2024-10-11 06:56:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 06:56:18,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:18,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:18,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 06:56:18,295 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:18,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash -664410462, now seen corresponding path program 1 times [2024-10-11 06:56:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:18,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666477486] [2024-10-11 06:56:18,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666477486] [2024-10-11 06:56:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666477486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:56:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111340553] [2024-10-11 06:56:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:18,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:56:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:56:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:56:18,564 INFO L87 Difference]: Start difference. First operand 399 states and 573 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:18,581 INFO L93 Difference]: Finished difference Result 672 states and 972 transitions. [2024-10-11 06:56:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:56:18,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 06:56:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:18,583 INFO L225 Difference]: With dead ends: 672 [2024-10-11 06:56:18,583 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 06:56:18,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-11 06:56:18,584 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:18,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:56:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 06:56:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-11 06:56:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.4345549738219896) internal successors, (548), 382 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 548 transitions. [2024-10-11 06:56:18,591 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 548 transitions. Word has length 86 [2024-10-11 06:56:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:18,591 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 548 transitions. [2024-10-11 06:56:18,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 548 transitions. [2024-10-11 06:56:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 06:56:18,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:18,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:18,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 06:56:18,592 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:18,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1571742470, now seen corresponding path program 1 times [2024-10-11 06:56:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865281081] [2024-10-11 06:56:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865281081] [2024-10-11 06:56:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865281081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:19,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:19,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 06:56:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145451470] [2024-10-11 06:56:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:19,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 06:56:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:19,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 06:56:19,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:56:19,145 INFO L87 Difference]: Start difference. First operand 383 states and 548 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:21,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:56:22,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 06:56:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:23,481 INFO L93 Difference]: Finished difference Result 693 states and 995 transitions. [2024-10-11 06:56:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 06:56:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 06:56:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:23,484 INFO L225 Difference]: With dead ends: 693 [2024-10-11 06:56:23,484 INFO L226 Difference]: Without dead ends: 430 [2024-10-11 06:56:23,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 06:56:23,485 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 551 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:23,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 4475 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 06:56:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-11 06:56:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 384. [2024-10-11 06:56:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.433420365535248) internal successors, (549), 383 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 549 transitions. [2024-10-11 06:56:23,493 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 549 transitions. Word has length 87 [2024-10-11 06:56:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 549 transitions. [2024-10-11 06:56:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 549 transitions. [2024-10-11 06:56:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 06:56:23,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:23,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:23,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 06:56:23,494 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1777048863, now seen corresponding path program 1 times [2024-10-11 06:56:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110113699] [2024-10-11 06:56:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:23,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110113699] [2024-10-11 06:56:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110113699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 06:56:23,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550391478] [2024-10-11 06:56:23,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:23,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:56:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:23,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:56:23,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:56:23,780 INFO L87 Difference]: Start difference. First operand 384 states and 549 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:23,839 INFO L93 Difference]: Finished difference Result 663 states and 955 transitions. [2024-10-11 06:56:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 06:56:23,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 06:56:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:23,841 INFO L225 Difference]: With dead ends: 663 [2024-10-11 06:56:23,841 INFO L226 Difference]: Without dead ends: 400 [2024-10-11 06:56:23,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:56:23,842 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 5 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:23,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2073 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:56:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-11 06:56:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 394. [2024-10-11 06:56:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.4325699745547074) internal successors, (563), 393 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 563 transitions. [2024-10-11 06:56:23,849 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 563 transitions. Word has length 87 [2024-10-11 06:56:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:23,849 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 563 transitions. [2024-10-11 06:56:23,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 563 transitions. [2024-10-11 06:56:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 06:56:23,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:23,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:23,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 06:56:23,850 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:23,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1735685051, now seen corresponding path program 1 times [2024-10-11 06:56:23,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:23,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409982268] [2024-10-11 06:56:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:24,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409982268] [2024-10-11 06:56:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409982268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:24,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 06:56:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886078668] [2024-10-11 06:56:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 06:56:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 06:56:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-10-11 06:56:24,539 INFO L87 Difference]: Start difference. First operand 394 states and 563 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:24,817 INFO L93 Difference]: Finished difference Result 703 states and 1009 transitions. [2024-10-11 06:56:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 06:56:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 06:56:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:24,818 INFO L225 Difference]: With dead ends: 703 [2024-10-11 06:56:24,818 INFO L226 Difference]: Without dead ends: 430 [2024-10-11 06:56:24,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-10-11 06:56:24,819 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 8 mSDsluCounter, 5010 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5347 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:24,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5347 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 06:56:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-11 06:56:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 423. [2024-10-11 06:56:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4289099526066351) internal successors, (603), 422 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 603 transitions. [2024-10-11 06:56:24,824 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 603 transitions. Word has length 87 [2024-10-11 06:56:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 603 transitions. [2024-10-11 06:56:24,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 603 transitions. [2024-10-11 06:56:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 06:56:24,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:24,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:24,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 06:56:24,825 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:24,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1197503027, now seen corresponding path program 1 times [2024-10-11 06:56:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:24,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267860445] [2024-10-11 06:56:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:56:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267860445] [2024-10-11 06:56:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267860445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 06:56:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142764879] [2024-10-11 06:56:25,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:25,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 06:56:25,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:56:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 06:56:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-11 06:56:25,649 INFO L87 Difference]: Start difference. First operand 423 states and 603 transitions. Second operand has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:26,106 INFO L93 Difference]: Finished difference Result 728 states and 1045 transitions. [2024-10-11 06:56:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 06:56:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-11 06:56:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:26,108 INFO L225 Difference]: With dead ends: 728 [2024-10-11 06:56:26,108 INFO L226 Difference]: Without dead ends: 423 [2024-10-11 06:56:26,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-11 06:56:26,109 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 329 mSDsluCounter, 5675 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 5992 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:26,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 5992 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 06:56:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-11 06:56:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-10-11 06:56:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4289099526066351) internal successors, (603), 422 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 603 transitions. [2024-10-11 06:56:26,115 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 603 transitions. Word has length 88 [2024-10-11 06:56:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:26,115 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 603 transitions. [2024-10-11 06:56:26,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 603 transitions. [2024-10-11 06:56:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 06:56:26,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:26,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 06:56:26,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 06:56:26,116 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:26,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:26,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1967914641, now seen corresponding path program 1 times [2024-10-11 06:56:26,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:56:26,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439060197] [2024-10-11 06:56:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:56:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:56:26,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:56:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:56:26,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:56:26,225 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:56:26,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:56:26,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 06:56:26,229 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 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-10-11 06:56:26,289 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:56:26,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:56:26 BoogieIcfgContainer [2024-10-11 06:56:26,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:56:26,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:56:26,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:56:26,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:56:26,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:55:39" (3/4) ... [2024-10-11 06:56:26,295 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:56:26,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:56:26,296 INFO L158 Benchmark]: Toolchain (without parser) took 49832.82ms. Allocated memory was 159.4MB in the beginning and 398.5MB in the end (delta: 239.1MB). Free memory was 84.0MB in the beginning and 140.1MB in the end (delta: -56.1MB). Peak memory consumption was 183.6MB. Max. memory is 16.1GB. [2024-10-11 06:56:26,296 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:56:26,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.19ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 83.8MB in the beginning and 165.1MB in the end (delta: -81.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-10-11 06:56:26,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.34ms. Allocated memory is still 211.8MB. Free memory was 165.1MB in the beginning and 136.7MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 06:56:26,297 INFO L158 Benchmark]: Boogie Preprocessor took 166.44ms. Allocated memory is still 211.8MB. Free memory was 136.7MB in the beginning and 115.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 06:56:26,297 INFO L158 Benchmark]: RCFGBuilder took 1822.65ms. Allocated memory is still 211.8MB. Free memory was 115.8MB in the beginning and 121.4MB in the end (delta: -5.6MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-10-11 06:56:26,299 INFO L158 Benchmark]: TraceAbstraction took 47216.75ms. Allocated memory was 211.8MB in the beginning and 398.5MB in the end (delta: 186.6MB). Free memory was 121.4MB in the beginning and 140.1MB in the end (delta: -18.8MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. [2024-10-11 06:56:26,299 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 398.5MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:56:26,300 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.19ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 83.8MB in the beginning and 165.1MB in the end (delta: -81.2MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.34ms. Allocated memory is still 211.8MB. Free memory was 165.1MB in the beginning and 136.7MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 166.44ms. Allocated memory is still 211.8MB. Free memory was 136.7MB in the beginning and 115.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1822.65ms. Allocated memory is still 211.8MB. Free memory was 115.8MB in the beginning and 121.4MB in the end (delta: -5.6MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * TraceAbstraction took 47216.75ms. Allocated memory was 211.8MB in the beginning and 398.5MB in the end (delta: 186.6MB). Free memory was 121.4MB in the beginning and 140.1MB in the end (delta: -18.8MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 398.5MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 191. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_45 = 1; [L37] const SORT_1 var_49 = 1; [L38] const SORT_5 var_60 = 0; [L39] const SORT_3 var_81 = 0; [L40] const SORT_3 var_90 = 1; [L41] const SORT_3 var_99 = 2; [L42] const SORT_3 var_108 = 3; [L44] SORT_1 input_2; [L45] SORT_3 input_4; [L46] SORT_5 input_6; [L47] SORT_1 input_7; [L48] SORT_3 input_8; [L49] SORT_3 input_9; [L50] SORT_5 input_10; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L52] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L53] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L54] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L55] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L56] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L57] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L58] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L59] SORT_1 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L60] SORT_5 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L61] SORT_5 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L62] SORT_5 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L63] SORT_5 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L64] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L65] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L66] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L67] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_13_arg_1 = var_11; [L70] state_12 = init_13_arg_1 [L71] SORT_1 init_16_arg_1 = var_11; [L72] state_15 = init_16_arg_1 [L73] SORT_1 init_21_arg_1 = var_11; [L74] state_20 = init_21_arg_1 [L75] SORT_1 init_27_arg_1 = var_11; [L76] state_26 = init_27_arg_1 [L77] SORT_1 init_51_arg_1 = var_49; [L78] state_50 = init_51_arg_1 [L79] SORT_1 init_53_arg_1 = var_11; [L80] state_52 = init_53_arg_1 [L81] SORT_1 init_55_arg_1 = var_11; [L82] state_54 = init_55_arg_1 [L83] SORT_1 init_57_arg_1 = var_11; [L84] state_56 = init_57_arg_1 [L85] SORT_5 init_59_arg_1 = var_45; [L86] state_58 = init_59_arg_1 [L87] SORT_5 init_62_arg_1 = var_60; [L88] state_61 = init_62_arg_1 [L89] SORT_5 init_64_arg_1 = var_60; [L90] state_63 = init_64_arg_1 [L91] SORT_5 init_66_arg_1 = var_60; [L92] state_65 = init_66_arg_1 [L93] SORT_1 init_69_arg_1 = var_11; [L94] state_68 = init_69_arg_1 [L95] SORT_1 init_71_arg_1 = var_11; [L96] state_70 = init_71_arg_1 [L97] SORT_1 init_73_arg_1 = var_11; [L98] state_72 = init_73_arg_1 [L99] SORT_1 init_75_arg_1 = var_11; [L100] state_74 = init_75_arg_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L103] input_2 = __VERIFIER_nondet_uchar() [L104] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L104] input_2 = input_2 & mask_SORT_1 [L105] input_4 = __VERIFIER_nondet_uchar() [L106] EXPR input_4 & mask_SORT_3 VAL [input_2=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L106] input_4 = input_4 & mask_SORT_3 [L107] input_6 = __VERIFIER_nondet_uchar() [L108] input_7 = __VERIFIER_nondet_uchar() [L109] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_4=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L109] input_7 = input_7 & mask_SORT_1 [L110] input_8 = __VERIFIER_nondet_uchar() [L111] EXPR input_8 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L111] input_8 = input_8 & mask_SORT_3 [L112] input_9 = __VERIFIER_nondet_uchar() [L113] EXPR input_9 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L113] input_9 = input_9 & mask_SORT_3 [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_5 VAL [input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L115] input_10 = input_10 & mask_SORT_5 [L118] SORT_1 var_14_arg_0 = state_12; [L119] SORT_1 var_14_arg_1 = var_11; [L120] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L121] SORT_1 var_17_arg_0 = state_12; [L122] SORT_1 var_17_arg_1 = state_15; [L123] SORT_5 var_17 = var_17_arg_0 != var_17_arg_1; [L124] SORT_5 var_18_arg_0 = var_14; [L125] SORT_5 var_18_arg_1 = var_17; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18_arg_0=1, var_18_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] EXPR var_18_arg_0 | var_18_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] SORT_5 var_18 = var_18_arg_0 | var_18_arg_1; [L127] SORT_1 var_19_arg_0 = state_12; [L128] SORT_1 var_19_arg_1 = var_11; [L129] SORT_5 var_19 = var_19_arg_0 == var_19_arg_1; [L130] SORT_1 var_22_arg_0 = state_12; [L131] SORT_1 var_22_arg_1 = state_20; [L132] SORT_5 var_22 = var_22_arg_0 != var_22_arg_1; [L133] SORT_5 var_23_arg_0 = var_19; [L134] SORT_5 var_23_arg_1 = var_22; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_23_arg_0=1, var_23_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] SORT_5 var_23 = var_23_arg_0 | var_23_arg_1; [L136] SORT_5 var_24_arg_0 = var_18; [L137] SORT_5 var_24_arg_1 = var_23; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24_arg_0=1, var_24_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] SORT_5 var_24 = var_24_arg_0 & var_24_arg_1; [L139] SORT_1 var_25_arg_0 = state_12; [L140] SORT_1 var_25_arg_1 = var_11; [L141] SORT_5 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_1 var_28_arg_0 = state_12; [L143] SORT_1 var_28_arg_1 = state_26; [L144] SORT_5 var_28 = var_28_arg_0 != var_28_arg_1; [L145] SORT_5 var_29_arg_0 = var_25; [L146] SORT_5 var_29_arg_1 = var_28; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_29_arg_0=1, var_29_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] EXPR var_29_arg_0 | var_29_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] SORT_5 var_29 = var_29_arg_0 | var_29_arg_1; [L148] SORT_5 var_30_arg_0 = var_24; [L149] SORT_5 var_30_arg_1 = var_29; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30_arg_0=1, var_30_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] SORT_5 var_30 = var_30_arg_0 & var_30_arg_1; [L151] SORT_1 var_31_arg_0 = state_15; [L152] SORT_1 var_31_arg_1 = var_11; [L153] SORT_5 var_31 = var_31_arg_0 == var_31_arg_1; [L154] SORT_1 var_32_arg_0 = state_15; [L155] SORT_1 var_32_arg_1 = state_20; [L156] SORT_5 var_32 = var_32_arg_0 != var_32_arg_1; [L157] SORT_5 var_33_arg_0 = var_31; [L158] SORT_5 var_33_arg_1 = var_32; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_33_arg_0=1, var_33_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] EXPR var_33_arg_0 | var_33_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] SORT_5 var_33 = var_33_arg_0 | var_33_arg_1; [L160] SORT_5 var_34_arg_0 = var_30; [L161] SORT_5 var_34_arg_1 = var_33; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34_arg_0=1, var_34_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] EXPR var_34_arg_0 & var_34_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] SORT_5 var_34 = var_34_arg_0 & var_34_arg_1; [L163] SORT_1 var_35_arg_0 = state_15; [L164] SORT_1 var_35_arg_1 = var_11; [L165] SORT_5 var_35 = var_35_arg_0 == var_35_arg_1; [L166] SORT_1 var_36_arg_0 = state_15; [L167] SORT_1 var_36_arg_1 = state_26; [L168] SORT_5 var_36 = var_36_arg_0 != var_36_arg_1; [L169] SORT_5 var_37_arg_0 = var_35; [L170] SORT_5 var_37_arg_1 = var_36; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_37_arg_0=1, var_37_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] SORT_5 var_37 = var_37_arg_0 | var_37_arg_1; [L172] SORT_5 var_38_arg_0 = var_34; [L173] SORT_5 var_38_arg_1 = var_37; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38_arg_0=1, var_38_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] SORT_5 var_38 = var_38_arg_0 & var_38_arg_1; [L175] SORT_1 var_39_arg_0 = state_20; [L176] SORT_1 var_39_arg_1 = var_11; [L177] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L178] SORT_1 var_40_arg_0 = state_20; [L179] SORT_1 var_40_arg_1 = state_26; [L180] SORT_5 var_40 = var_40_arg_0 != var_40_arg_1; [L181] SORT_5 var_41_arg_0 = var_39; [L182] SORT_5 var_41_arg_1 = var_40; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_41_arg_0=1, var_41_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] SORT_5 var_41 = var_41_arg_0 | var_41_arg_1; [L184] SORT_5 var_42_arg_0 = var_38; [L185] SORT_5 var_42_arg_1 = var_41; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_42_arg_0=1, var_42_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] SORT_5 var_42 = var_42_arg_0 & var_42_arg_1; [L187] SORT_5 var_46_arg_0 = var_42; [L188] SORT_5 var_46 = ~var_46_arg_0; [L189] SORT_5 var_47_arg_0 = var_45; [L190] SORT_5 var_47_arg_1 = var_46; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_47_arg_0=1, var_47_arg_1=-2, var_60=0, var_81=0, var_90=1, var_99=2] [L191] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L191] SORT_5 var_47 = var_47_arg_0 & var_47_arg_1; [L192] EXPR var_47 & mask_SORT_5 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L192] var_47 = var_47 & mask_SORT_5 [L193] SORT_5 bad_48_arg_0 = var_47; [L194] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 243 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.1s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7278 SdHoareTripleChecker+Valid, 33.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7278 mSDsluCounter, 61476 SdHoareTripleChecker+Invalid, 32.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52942 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5385 IncrementalHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 8534 mSDtfsCounter, 5385 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=24, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 694 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 2144 NumberOfCodeBlocks, 2144 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2031 ConstructedInterpolants, 0 QuantifiedInterpolants, 8349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 06:56:26,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:56:28,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:56:28,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:56:28,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:56:28,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:56:28,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:56:28,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:56:28,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:56:28,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:56:28,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:56:28,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:56:28,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:56:28,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:56:28,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:56:28,147 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:56:28,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:56:28,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:56:28,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:56:28,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:56:28,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:56:28,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:56:28,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:56:28,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:56:28,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:56:28,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:56:28,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:56:28,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:56:28,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:56:28,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:56:28,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:56:28,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:56:28,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:56:28,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:56:28,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:56:28,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:56:28,153 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:56:28,153 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2024-10-11 06:56:28,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:56:28,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:56:28,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:56:28,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:56:28,433 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:56:28,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-10-11 06:56:29,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:56:29,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:56:29,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-10-11 06:56:29,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e29b2889/640106471ebf4fcb965b928ea5fc9769/FLAG7607d3ebd [2024-10-11 06:56:29,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e29b2889/640106471ebf4fcb965b928ea5fc9769 [2024-10-11 06:56:29,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:56:29,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:56:29,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:56:29,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:56:29,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:56:29,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:56:29" (1/1) ... [2024-10-11 06:56:29,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383d661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:29, skipping insertion in model container [2024-10-11 06:56:29,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:56:29" (1/1) ... [2024-10-11 06:56:29,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:56:30,118 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-10-11 06:56:30,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:56:30,298 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:56:30,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-10-11 06:56:30,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:56:30,413 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:56:30,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30 WrapperNode [2024-10-11 06:56:30,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:56:30,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:56:30,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:56:30,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:56:30,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,498 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 900 [2024-10-11 06:56:30,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:56:30,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:56:30,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:56:30,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:56:30,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,555 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-10-11 06:56:30,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:56:30,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:56:30,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:56:30,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:56:30,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (1/1) ... [2024-10-11 06:56:30,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:56:30,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:56:30,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:56:30,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:56:30,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:56:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:56:30,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:56:30,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:56:30,868 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:56:30,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:56:31,383 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-11 06:56:31,383 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:56:31,417 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:56:31,417 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:56:31,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:56:31 BoogieIcfgContainer [2024-10-11 06:56:31,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:56:31,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:56:31,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:56:31,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:56:31,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:56:29" (1/3) ... [2024-10-11 06:56:31,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a15183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:56:31, skipping insertion in model container [2024-10-11 06:56:31,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:56:30" (2/3) ... [2024-10-11 06:56:31,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a15183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:56:31, skipping insertion in model container [2024-10-11 06:56:31,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:56:31" (3/3) ... [2024-10-11 06:56:31,425 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2024-10-11 06:56:31,437 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:56:31,437 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:56:31,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:56:31,484 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;@5977565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:56:31,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:56:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:56:31,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:31,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:56:31,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:56:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:56:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635458728] [2024-10-11 06:56:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:31,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:56:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:56:31,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:56:31,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 06:56:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:31,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 06:56:31,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:56:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:32,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:56:32,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:56:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635458728] [2024-10-11 06:56:32,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635458728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:56:32,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:56:32,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:56:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020844966] [2024-10-11 06:56:32,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:56:32,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:56:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:56:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:56:32,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:56:32,089 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:56:32,147 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:56:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:56:32,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 06:56:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:56:32,154 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:56:32,154 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:56:32,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 06:56:32,159 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:56:32,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:56:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:56:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:56:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:56:32,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:56:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:56:32,181 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:56:32,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:56:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:56:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:56:32,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:56:32,182 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:56:32,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 06:56:32,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:56:32,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:56:32,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:56:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:56:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:56:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216007338] [2024-10-11 06:56:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:56:32,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 06:56:32,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:56:32,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 06:56:32,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 06:56:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:56:32,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-11 06:56:32,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:56:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:56:44,634 INFO L311 TraceCheckSpWp]: Computing backward predicates...