./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:25:57,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:25:57,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:25:57,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:25:57,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:25:57,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:25:57,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:25:57,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:25:57,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:25:57,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:25:57,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:25:57,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:25:57,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:25:57,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:25:57,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:25:57,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:25:57,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:25:57,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:25:57,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:25:57,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:25:57,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:25:57,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:25:57,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:25:57,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:25:57,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:25:57,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:25:57,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:25:57,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:25:57,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:25:57,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:25:57,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:25:57,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:25:57,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:25:57,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:25:57,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:25:57,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:25:57,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:25:57,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:25:57,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:25:57,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 [2024-11-08 18:25:57,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:25:58,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:25:58,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:25:58,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:25:58,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:25:58,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-08 18:25:59,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:26:00,005 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:26:00,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-08 18:26:00,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0a12365/be3aed2741494f6f84b559c4f8f9c10b/FLAG32961772c [2024-11-08 18:26:00,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0a12365/be3aed2741494f6f84b559c4f8f9c10b [2024-11-08 18:26:00,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:26:00,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:26:00,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:00,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:26:00,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:26:00,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:00,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502891a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00, skipping insertion in model container [2024-11-08 18:26:00,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:00,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:26:00,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-08 18:26:00,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:00,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:26:00,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-08 18:26:00,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:00,921 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:26:00,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00 WrapperNode [2024-11-08 18:26:00,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:00,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:00,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:26:00,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:26:00,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,210 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2218 [2024-11-08 18:26:01,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:01,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:26:01,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:26:01,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:26:01,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,428 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:26:01,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:26:01,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:26:01,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:26:01,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:26:01,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (1/1) ... [2024-11-08 18:26:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:01,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:26:01,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:26:01,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:26:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:26:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:26:01,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:26:01,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:26:02,050 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:26:02,053 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:26:04,002 INFO L? ?]: Removed 1503 outVars from TransFormulas that were not future-live. [2024-11-08 18:26:04,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:26:04,022 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:26:04,025 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:26:04,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:04 BoogieIcfgContainer [2024-11-08 18:26:04,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:26:04,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:26:04,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:26:04,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:26:04,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:26:00" (1/3) ... [2024-11-08 18:26:04,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec9d0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:04, skipping insertion in model container [2024-11-08 18:26:04,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:00" (2/3) ... [2024-11-08 18:26:04,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec9d0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:04, skipping insertion in model container [2024-11-08 18:26:04,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:04" (3/3) ... [2024-11-08 18:26:04,038 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2024-11-08 18:26:04,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:26:04,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:26:04,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:26:04,157 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;@cc7574f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:26:04,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:26:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.4969135802469136) internal successors, (485), 325 states have internal predecessors, (485), 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-11-08 18:26:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 18:26:04,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:04,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:04,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1351493187, now seen corresponding path program 1 times [2024-11-08 18:26:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:04,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590683575] [2024-11-08 18:26:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590683575] [2024-11-08 18:26:06,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590683575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990330247] [2024-11-08 18:26:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:06,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:06,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:06,091 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.4969135802469136) internal successors, (485), 325 states have internal predecessors, (485), 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 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-11-08 18:26:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:06,277 INFO L93 Difference]: Finished difference Result 619 states and 924 transitions. [2024-11-08 18:26:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2024-11-08 18:26:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:06,302 INFO L225 Difference]: With dead ends: 619 [2024-11-08 18:26:06,302 INFO L226 Difference]: Without dead ends: 327 [2024-11-08 18:26:06,307 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-11-08 18:26:06,314 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 395 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:06,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1418 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-08 18:26:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 326. [2024-11-08 18:26:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4892307692307691) internal successors, (484), 325 states have internal predecessors, (484), 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-11-08 18:26:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-11-08 18:26:06,391 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 99 [2024-11-08 18:26:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:06,393 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-11-08 18:26:06,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-11-08 18:26:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-11-08 18:26:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 18:26:06,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:06,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:06,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:26:06,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:06,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:06,400 INFO L85 PathProgramCache]: Analyzing trace with hash 845651071, now seen corresponding path program 1 times [2024-11-08 18:26:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:06,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686986142] [2024-11-08 18:26:06,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:06,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686986142] [2024-11-08 18:26:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686986142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:06,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486029344] [2024-11-08 18:26:06,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:06,933 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-11-08 18:26:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:07,000 INFO L93 Difference]: Finished difference Result 640 states and 951 transitions. [2024-11-08 18:26:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:07,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 100 [2024-11-08 18:26:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:07,005 INFO L225 Difference]: With dead ends: 640 [2024-11-08 18:26:07,008 INFO L226 Difference]: Without dead ends: 348 [2024-11-08 18:26:07,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:07,011 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 20 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:07,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2372 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-08 18:26:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-11-08 18:26:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4870317002881845) internal successors, (516), 347 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-11-08 18:26:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 516 transitions. [2024-11-08 18:26:07,034 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 516 transitions. Word has length 100 [2024-11-08 18:26:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:07,035 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 516 transitions. [2024-11-08 18:26:07,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-11-08 18:26:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 516 transitions. [2024-11-08 18:26:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 18:26:07,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:07,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:07,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:26:07,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1922552128, now seen corresponding path program 1 times [2024-11-08 18:26:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:07,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699308590] [2024-11-08 18:26:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699308590] [2024-11-08 18:26:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699308590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989596874] [2024-11-08 18:26:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:07,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:07,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:07,646 INFO L87 Difference]: Start difference. First operand 348 states and 516 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-11-08 18:26:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:07,674 INFO L93 Difference]: Finished difference Result 352 states and 520 transitions. [2024-11-08 18:26:07,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:07,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 101 [2024-11-08 18:26:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:07,677 INFO L225 Difference]: With dead ends: 352 [2024-11-08 18:26:07,677 INFO L226 Difference]: Without dead ends: 350 [2024-11-08 18:26:07,678 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-11-08 18:26:07,679 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1431 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-11-08 18:26:07,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-08 18:26:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-08 18:26:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.484240687679083) internal successors, (518), 349 states have internal predecessors, (518), 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-11-08 18:26:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 518 transitions. [2024-11-08 18:26:07,697 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 518 transitions. Word has length 101 [2024-11-08 18:26:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:07,698 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 518 transitions. [2024-11-08 18:26:07,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-11-08 18:26:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 518 transitions. [2024-11-08 18:26:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:26:07,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:07,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:26:07,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash 532121940, now seen corresponding path program 1 times [2024-11-08 18:26:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821395780] [2024-11-08 18:26:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821395780] [2024-11-08 18:26:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821395780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:26:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400770923] [2024-11-08 18:26:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:08,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:26:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:26:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:08,973 INFO L87 Difference]: Start difference. First operand 350 states and 518 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-11-08 18:26:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:09,569 INFO L93 Difference]: Finished difference Result 981 states and 1453 transitions. [2024-11-08 18:26:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:26:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 102 [2024-11-08 18:26:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:09,572 INFO L225 Difference]: With dead ends: 981 [2024-11-08 18:26:09,573 INFO L226 Difference]: Without dead ends: 665 [2024-11-08 18:26:09,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:26:09,575 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1274 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:09,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1807 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:26:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-08 18:26:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 467. [2024-11-08 18:26:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.4849785407725322) internal successors, (692), 466 states have internal predecessors, (692), 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-11-08 18:26:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 692 transitions. [2024-11-08 18:26:09,591 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 692 transitions. Word has length 102 [2024-11-08 18:26:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 692 transitions. [2024-11-08 18:26:09,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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-11-08 18:26:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 692 transitions. [2024-11-08 18:26:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 18:26:09,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:09,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:26:09,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:09,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1687514873, now seen corresponding path program 1 times [2024-11-08 18:26:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:09,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269162716] [2024-11-08 18:26:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269162716] [2024-11-08 18:26:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269162716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704293549] [2024-11-08 18:26:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:10,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:10,325 INFO L87 Difference]: Start difference. First operand 467 states and 692 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-11-08 18:26:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:10,401 INFO L93 Difference]: Finished difference Result 789 states and 1170 transitions. [2024-11-08 18:26:10,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:10,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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 103 [2024-11-08 18:26:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:10,404 INFO L225 Difference]: With dead ends: 789 [2024-11-08 18:26:10,404 INFO L226 Difference]: Without dead ends: 473 [2024-11-08 18:26:10,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:10,405 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 17 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:10,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1423 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-08 18:26:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-11-08 18:26:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.478813559322034) internal successors, (698), 472 states have internal predecessors, (698), 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-11-08 18:26:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 698 transitions. [2024-11-08 18:26:10,416 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 698 transitions. Word has length 103 [2024-11-08 18:26:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:10,417 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 698 transitions. [2024-11-08 18:26:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-11-08 18:26:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 698 transitions. [2024-11-08 18:26:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 18:26:10,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:10,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:10,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:26:10,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2145927774, now seen corresponding path program 1 times [2024-11-08 18:26:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903976211] [2024-11-08 18:26:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903976211] [2024-11-08 18:26:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903976211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:12,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:12,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:26:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79119334] [2024-11-08 18:26:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:12,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:26:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:12,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:26:12,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:26:12,238 INFO L87 Difference]: Start difference. First operand 473 states and 698 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-11-08 18:26:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:12,604 INFO L93 Difference]: Finished difference Result 868 states and 1280 transitions. [2024-11-08 18:26:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:26:12,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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 104 [2024-11-08 18:26:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:12,607 INFO L225 Difference]: With dead ends: 868 [2024-11-08 18:26:12,607 INFO L226 Difference]: Without dead ends: 505 [2024-11-08 18:26:12,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:26:12,611 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 466 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:12,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 3617 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:26:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-08 18:26:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 497. [2024-11-08 18:26:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4798387096774193) internal successors, (734), 496 states have internal predecessors, (734), 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-11-08 18:26:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 734 transitions. [2024-11-08 18:26:12,627 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 734 transitions. Word has length 104 [2024-11-08 18:26:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:12,627 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 734 transitions. [2024-11-08 18:26:12,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-11-08 18:26:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2024-11-08 18:26:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:26:12,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:12,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:12,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:26:12,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:12,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -845179228, now seen corresponding path program 1 times [2024-11-08 18:26:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127324205] [2024-11-08 18:26:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:13,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127324205] [2024-11-08 18:26:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127324205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:26:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769486278] [2024-11-08 18:26:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:26:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:13,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:26:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:26:13,799 INFO L87 Difference]: Start difference. First operand 497 states and 734 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-11-08 18:26:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:13,919 INFO L93 Difference]: Finished difference Result 898 states and 1324 transitions. [2024-11-08 18:26:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:26:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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 105 [2024-11-08 18:26:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:13,922 INFO L225 Difference]: With dead ends: 898 [2024-11-08 18:26:13,922 INFO L226 Difference]: Without dead ends: 523 [2024-11-08 18:26:13,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-11-08 18:26:13,924 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 7 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:13,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2785 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-08 18:26:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2024-11-08 18:26:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.4787644787644787) internal successors, (766), 518 states have internal predecessors, (766), 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-11-08 18:26:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 766 transitions. [2024-11-08 18:26:13,934 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 766 transitions. Word has length 105 [2024-11-08 18:26:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 766 transitions. [2024-11-08 18:26:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-11-08 18:26:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 766 transitions. [2024-11-08 18:26:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 18:26:13,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:13,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:26:13,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash -720329080, now seen corresponding path program 1 times [2024-11-08 18:26:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791033987] [2024-11-08 18:26:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791033987] [2024-11-08 18:26:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791033987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:14,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:14,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440841366] [2024-11-08 18:26:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:14,489 INFO L87 Difference]: Start difference. First operand 519 states and 766 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-11-08 18:26:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:14,708 INFO L93 Difference]: Finished difference Result 935 states and 1379 transitions. [2024-11-08 18:26:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 105 [2024-11-08 18:26:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:14,711 INFO L225 Difference]: With dead ends: 935 [2024-11-08 18:26:14,711 INFO L226 Difference]: Without dead ends: 527 [2024-11-08 18:26:14,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:14,713 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 438 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:14,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1193 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:26:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-08 18:26:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2024-11-08 18:26:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 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-11-08 18:26:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 774 transitions. [2024-11-08 18:26:14,727 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 774 transitions. Word has length 105 [2024-11-08 18:26:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 774 transitions. [2024-11-08 18:26:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-11-08 18:26:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 774 transitions. [2024-11-08 18:26:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:26:14,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:14,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:14,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:26:14,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2136993919, now seen corresponding path program 1 times [2024-11-08 18:26:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041474878] [2024-11-08 18:26:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041474878] [2024-11-08 18:26:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041474878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:26:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660711415] [2024-11-08 18:26:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:26:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:26:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:26:16,380 INFO L87 Difference]: Start difference. First operand 525 states and 774 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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-11-08 18:26:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:16,901 INFO L93 Difference]: Finished difference Result 1235 states and 1807 transitions. [2024-11-08 18:26:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:26:16,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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 106 [2024-11-08 18:26:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:16,907 INFO L225 Difference]: With dead ends: 1235 [2024-11-08 18:26:16,908 INFO L226 Difference]: Without dead ends: 850 [2024-11-08 18:26:16,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:26:16,912 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 970 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:16,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 3633 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:26:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-08 18:26:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 570. [2024-11-08 18:26:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4745166959578206) internal successors, (839), 569 states have internal predecessors, (839), 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-11-08 18:26:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 839 transitions. [2024-11-08 18:26:16,933 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 839 transitions. Word has length 106 [2024-11-08 18:26:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:16,934 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 839 transitions. [2024-11-08 18:26:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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-11-08 18:26:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 839 transitions. [2024-11-08 18:26:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 18:26:16,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:16,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:16,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:26:16,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:16,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1738447973, now seen corresponding path program 1 times [2024-11-08 18:26:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217730767] [2024-11-08 18:26:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217730767] [2024-11-08 18:26:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217730767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:18,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:26:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111565326] [2024-11-08 18:26:18,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:18,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:26:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:26:18,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:26:18,284 INFO L87 Difference]: Start difference. First operand 570 states and 839 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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-11-08 18:26:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:19,189 INFO L93 Difference]: Finished difference Result 1228 states and 1802 transitions. [2024-11-08 18:26:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:26:19,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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 106 [2024-11-08 18:26:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:19,193 INFO L225 Difference]: With dead ends: 1228 [2024-11-08 18:26:19,194 INFO L226 Difference]: Without dead ends: 711 [2024-11-08 18:26:19,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:26:19,196 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 1138 mSDsluCounter, 5072 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 5497 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:19,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 5497 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:26:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-08 18:26:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 597. [2024-11-08 18:26:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.471476510067114) internal successors, (877), 596 states have internal predecessors, (877), 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-11-08 18:26:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 877 transitions. [2024-11-08 18:26:19,211 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 877 transitions. Word has length 106 [2024-11-08 18:26:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:19,211 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 877 transitions. [2024-11-08 18:26:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 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-11-08 18:26:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 877 transitions. [2024-11-08 18:26:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:26:19,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:19,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:26:19,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -649953321, now seen corresponding path program 1 times [2024-11-08 18:26:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323834797] [2024-11-08 18:26:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323834797] [2024-11-08 18:26:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323834797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:19,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:19,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975183900] [2024-11-08 18:26:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:19,679 INFO L87 Difference]: Start difference. First operand 597 states and 877 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-11-08 18:26:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:19,848 INFO L93 Difference]: Finished difference Result 1138 states and 1672 transitions. [2024-11-08 18:26:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:19,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 107 [2024-11-08 18:26:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:19,852 INFO L225 Difference]: With dead ends: 1138 [2024-11-08 18:26:19,852 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 18:26:19,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:26:19,853 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 454 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:19,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1768 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 18:26:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-08 18:26:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4641068447412353) internal successors, (877), 599 states have internal predecessors, (877), 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-11-08 18:26:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 877 transitions. [2024-11-08 18:26:19,865 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 877 transitions. Word has length 107 [2024-11-08 18:26:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 877 transitions. [2024-11-08 18:26:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-11-08 18:26:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 877 transitions. [2024-11-08 18:26:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:26:19,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:19,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:26:19,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash -421717905, now seen corresponding path program 1 times [2024-11-08 18:26:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703447541] [2024-11-08 18:26:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703447541] [2024-11-08 18:26:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703447541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520061554] [2024-11-08 18:26:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:20,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:20,401 INFO L87 Difference]: Start difference. First operand 600 states and 877 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-08 18:26:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:20,455 INFO L93 Difference]: Finished difference Result 994 states and 1455 transitions. [2024-11-08 18:26:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:20,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 107 [2024-11-08 18:26:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:20,458 INFO L225 Difference]: With dead ends: 994 [2024-11-08 18:26:20,459 INFO L226 Difference]: Without dead ends: 608 [2024-11-08 18:26:20,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:20,460 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 3 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:20,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1869 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-08 18:26:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2024-11-08 18:26:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4602649006622517) internal successors, (882), 604 states have internal predecessors, (882), 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-11-08 18:26:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 882 transitions. [2024-11-08 18:26:20,472 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 882 transitions. Word has length 107 [2024-11-08 18:26:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 882 transitions. [2024-11-08 18:26:20,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-08 18:26:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 882 transitions. [2024-11-08 18:26:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:26:20,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:20,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:20,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:26:20,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:20,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash -666926079, now seen corresponding path program 1 times [2024-11-08 18:26:20,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077004665] [2024-11-08 18:26:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:20,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077004665] [2024-11-08 18:26:20,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077004665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:20,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:20,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018837804] [2024-11-08 18:26:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:20,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:20,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:20,742 INFO L87 Difference]: Start difference. First operand 605 states and 882 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 18:26:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:20,796 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2024-11-08 18:26:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2024-11-08 18:26:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:20,799 INFO L225 Difference]: With dead ends: 1093 [2024-11-08 18:26:20,799 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 18:26:20,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:20,801 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 432 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:20,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 921 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 18:26:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-08 18:26:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4557595993322203) internal successors, (872), 599 states have internal predecessors, (872), 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-11-08 18:26:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 872 transitions. [2024-11-08 18:26:20,813 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 872 transitions. Word has length 107 [2024-11-08 18:26:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:20,814 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 872 transitions. [2024-11-08 18:26:20,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 18:26:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 872 transitions. [2024-11-08 18:26:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:26:20,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:20,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:20,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:26:20,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -298937446, now seen corresponding path program 1 times [2024-11-08 18:26:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585985976] [2024-11-08 18:26:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585985976] [2024-11-08 18:26:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585985976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:26:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304941545] [2024-11-08 18:26:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:26:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:26:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:21,284 INFO L87 Difference]: Start difference. First operand 600 states and 872 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 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-11-08 18:26:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:21,426 INFO L93 Difference]: Finished difference Result 1117 states and 1625 transitions. [2024-11-08 18:26:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:26:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 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 107 [2024-11-08 18:26:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:21,429 INFO L225 Difference]: With dead ends: 1117 [2024-11-08 18:26:21,429 INFO L226 Difference]: Without dead ends: 615 [2024-11-08 18:26:21,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:26:21,431 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 441 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:21,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2234 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-08 18:26:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2024-11-08 18:26:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4495114006514658) internal successors, (890), 614 states have internal predecessors, (890), 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-11-08 18:26:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2024-11-08 18:26:21,446 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 107 [2024-11-08 18:26:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:21,446 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2024-11-08 18:26:21,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 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-11-08 18:26:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2024-11-08 18:26:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:26:21,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:21,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:21,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:26:21,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:21,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1091871874, now seen corresponding path program 1 times [2024-11-08 18:26:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584278117] [2024-11-08 18:26:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584278117] [2024-11-08 18:26:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584278117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345271397] [2024-11-08 18:26:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:21,735 INFO L87 Difference]: Start difference. First operand 615 states and 890 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 18:26:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:21,793 INFO L93 Difference]: Finished difference Result 1129 states and 1637 transitions. [2024-11-08 18:26:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2024-11-08 18:26:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:21,796 INFO L225 Difference]: With dead ends: 1129 [2024-11-08 18:26:21,797 INFO L226 Difference]: Without dead ends: 610 [2024-11-08 18:26:21,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:21,800 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 438 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:21,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 913 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-08 18:26:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-08 18:26:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.444991789819376) internal successors, (880), 609 states have internal predecessors, (880), 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-11-08 18:26:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 880 transitions. [2024-11-08 18:26:21,815 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 880 transitions. Word has length 107 [2024-11-08 18:26:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 880 transitions. [2024-11-08 18:26:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 18:26:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 880 transitions. [2024-11-08 18:26:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 18:26:21,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:21,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:21,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:26:21,818 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:21,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:21,818 INFO L85 PathProgramCache]: Analyzing trace with hash -781368887, now seen corresponding path program 1 times [2024-11-08 18:26:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101949494] [2024-11-08 18:26:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101949494] [2024-11-08 18:26:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101949494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843860534] [2024-11-08 18:26:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:22,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:22,125 INFO L87 Difference]: Start difference. First operand 610 states and 880 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 18:26:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:22,185 INFO L93 Difference]: Finished difference Result 1126 states and 1628 transitions. [2024-11-08 18:26:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 107 [2024-11-08 18:26:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:22,188 INFO L225 Difference]: With dead ends: 1126 [2024-11-08 18:26:22,188 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 18:26:22,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:22,191 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 440 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:22,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 905 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 18:26:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-08 18:26:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 599 states have internal predecessors, (865), 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-11-08 18:26:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 865 transitions. [2024-11-08 18:26:22,204 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 865 transitions. Word has length 107 [2024-11-08 18:26:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:22,205 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 865 transitions. [2024-11-08 18:26:22,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-11-08 18:26:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 865 transitions. [2024-11-08 18:26:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 18:26:22,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:22,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:26:22,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:22,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash 404976836, now seen corresponding path program 1 times [2024-11-08 18:26:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184771991] [2024-11-08 18:26:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184771991] [2024-11-08 18:26:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184771991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605696503] [2024-11-08 18:26:23,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:23,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:23,576 INFO L87 Difference]: Start difference. First operand 600 states and 865 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-08 18:26:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:23,722 INFO L93 Difference]: Finished difference Result 1056 states and 1521 transitions. [2024-11-08 18:26:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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 108 [2024-11-08 18:26:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:23,725 INFO L225 Difference]: With dead ends: 1056 [2024-11-08 18:26:23,725 INFO L226 Difference]: Without dead ends: 700 [2024-11-08 18:26:23,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-08 18:26:23,727 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 839 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1330 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:23,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1330 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-08 18:26:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 600. [2024-11-08 18:26:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4424040066777963) internal successors, (864), 599 states have internal predecessors, (864), 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-11-08 18:26:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 864 transitions. [2024-11-08 18:26:23,741 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 864 transitions. Word has length 108 [2024-11-08 18:26:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:23,742 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 864 transitions. [2024-11-08 18:26:23,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-08 18:26:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 864 transitions. [2024-11-08 18:26:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:26:23,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:23,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:23,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:26:23,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:23,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2144833123, now seen corresponding path program 1 times [2024-11-08 18:26:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:23,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502397469] [2024-11-08 18:26:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:23,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:25,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:25,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502397469] [2024-11-08 18:26:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502397469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830998615] [2024-11-08 18:26:25,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:25,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:25,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:25,095 INFO L87 Difference]: Start difference. First operand 600 states and 864 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-11-08 18:26:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:25,329 INFO L93 Difference]: Finished difference Result 1068 states and 1537 transitions. [2024-11-08 18:26:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 109 [2024-11-08 18:26:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:25,333 INFO L225 Difference]: With dead ends: 1068 [2024-11-08 18:26:25,334 INFO L226 Difference]: Without dead ends: 700 [2024-11-08 18:26:25,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-08 18:26:25,335 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 650 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:25,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1326 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:26:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-08 18:26:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 600. [2024-11-08 18:26:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4407345575959933) internal successors, (863), 599 states have internal predecessors, (863), 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-11-08 18:26:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 863 transitions. [2024-11-08 18:26:25,349 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 863 transitions. Word has length 109 [2024-11-08 18:26:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:25,350 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 863 transitions. [2024-11-08 18:26:25,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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-11-08 18:26:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 863 transitions. [2024-11-08 18:26:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:25,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:25,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:25,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:26:25,352 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:25,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1221094713, now seen corresponding path program 1 times [2024-11-08 18:26:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:25,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082379407] [2024-11-08 18:26:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:25,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:27,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082379407] [2024-11-08 18:26:27,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082379407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:27,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:26:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459657868] [2024-11-08 18:26:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:27,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:26:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:26:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:26:27,013 INFO L87 Difference]: Start difference. First operand 600 states and 863 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 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-11-08 18:26:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:27,353 INFO L93 Difference]: Finished difference Result 1068 states and 1535 transitions. [2024-11-08 18:26:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:26:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 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 110 [2024-11-08 18:26:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:27,356 INFO L225 Difference]: With dead ends: 1068 [2024-11-08 18:26:27,357 INFO L226 Difference]: Without dead ends: 694 [2024-11-08 18:26:27,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:26:27,359 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 490 mSDsluCounter, 3612 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:27,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 4062 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:26:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-08 18:26:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-08 18:26:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4317180616740088) internal successors, (975), 681 states have internal predecessors, (975), 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-11-08 18:26:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 975 transitions. [2024-11-08 18:26:27,379 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 975 transitions. Word has length 110 [2024-11-08 18:26:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:27,379 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 975 transitions. [2024-11-08 18:26:27,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 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-11-08 18:26:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 975 transitions. [2024-11-08 18:26:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:27,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:27,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:26:27,382 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -184897447, now seen corresponding path program 1 times [2024-11-08 18:26:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414612799] [2024-11-08 18:26:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414612799] [2024-11-08 18:26:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414612799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:27,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:27,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337258561] [2024-11-08 18:26:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:27,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:27,900 INFO L87 Difference]: Start difference. First operand 682 states and 975 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-11-08 18:26:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:27,934 INFO L93 Difference]: Finished difference Result 1106 states and 1585 transitions. [2024-11-08 18:26:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 110 [2024-11-08 18:26:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:27,937 INFO L225 Difference]: With dead ends: 1106 [2024-11-08 18:26:27,937 INFO L226 Difference]: Without dead ends: 653 [2024-11-08 18:26:27,938 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-11-08 18:26:27,939 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:27,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1380 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-08 18:26:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2024-11-08 18:26:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4294478527607362) internal successors, (932), 652 states have internal predecessors, (932), 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-11-08 18:26:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 932 transitions. [2024-11-08 18:26:27,957 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 932 transitions. Word has length 110 [2024-11-08 18:26:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:27,957 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 932 transitions. [2024-11-08 18:26:27,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-11-08 18:26:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 932 transitions. [2024-11-08 18:26:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:27,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:27,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:27,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:26:27,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash -651184319, now seen corresponding path program 1 times [2024-11-08 18:26:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510073912] [2024-11-08 18:26:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510073912] [2024-11-08 18:26:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510073912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97253698] [2024-11-08 18:26:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:28,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:28,270 INFO L87 Difference]: Start difference. First operand 653 states and 932 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-11-08 18:26:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:28,386 INFO L93 Difference]: Finished difference Result 1347 states and 1925 transitions. [2024-11-08 18:26:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 110 [2024-11-08 18:26:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:28,390 INFO L225 Difference]: With dead ends: 1347 [2024-11-08 18:26:28,390 INFO L226 Difference]: Without dead ends: 787 [2024-11-08 18:26:28,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:28,392 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 1044 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:28,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1348 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-08 18:26:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 647. [2024-11-08 18:26:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4241486068111455) internal successors, (920), 646 states have internal predecessors, (920), 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-11-08 18:26:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 920 transitions. [2024-11-08 18:26:28,410 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 920 transitions. Word has length 110 [2024-11-08 18:26:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:28,410 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 920 transitions. [2024-11-08 18:26:28,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-11-08 18:26:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 920 transitions. [2024-11-08 18:26:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:28,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:28,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:28,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:26:28,413 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:28,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1335204232, now seen corresponding path program 1 times [2024-11-08 18:26:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:28,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718506345] [2024-11-08 18:26:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718506345] [2024-11-08 18:26:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718506345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:26:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489444400] [2024-11-08 18:26:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:28,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:26:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:28,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:26:28,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:28,976 INFO L87 Difference]: Start difference. First operand 647 states and 920 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-11-08 18:26:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:29,434 INFO L93 Difference]: Finished difference Result 1365 states and 1943 transitions. [2024-11-08 18:26:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:26:29,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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 110 [2024-11-08 18:26:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:29,442 INFO L225 Difference]: With dead ends: 1365 [2024-11-08 18:26:29,443 INFO L226 Difference]: Without dead ends: 789 [2024-11-08 18:26:29,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:26:29,445 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1049 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:29,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1885 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:26:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-08 18:26:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 649. [2024-11-08 18:26:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4197530864197532) internal successors, (920), 648 states have internal predecessors, (920), 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-11-08 18:26:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 920 transitions. [2024-11-08 18:26:29,467 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 920 transitions. Word has length 110 [2024-11-08 18:26:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:29,468 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 920 transitions. [2024-11-08 18:26:29,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-11-08 18:26:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 920 transitions. [2024-11-08 18:26:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:26:29,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:29,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:29,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:26:29,470 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:29,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:29,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2005973537, now seen corresponding path program 1 times [2024-11-08 18:26:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:29,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25588086] [2024-11-08 18:26:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25588086] [2024-11-08 18:26:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25588086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:29,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473505247] [2024-11-08 18:26:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:29,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:29,783 INFO L87 Difference]: Start difference. First operand 649 states and 920 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-11-08 18:26:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:30,093 INFO L93 Difference]: Finished difference Result 1338 states and 1900 transitions. [2024-11-08 18:26:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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 110 [2024-11-08 18:26:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:30,098 INFO L225 Difference]: With dead ends: 1338 [2024-11-08 18:26:30,099 INFO L226 Difference]: Without dead ends: 745 [2024-11-08 18:26:30,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:30,100 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 978 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:30,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1340 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:26:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-08 18:26:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 625. [2024-11-08 18:26:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4246794871794872) internal successors, (889), 624 states have internal predecessors, (889), 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-11-08 18:26:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 889 transitions. [2024-11-08 18:26:30,116 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 889 transitions. Word has length 110 [2024-11-08 18:26:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:30,116 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 889 transitions. [2024-11-08 18:26:30,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-11-08 18:26:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 889 transitions. [2024-11-08 18:26:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:26:30,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:30,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:30,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:26:30,118 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1789769743, now seen corresponding path program 1 times [2024-11-08 18:26:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573084650] [2024-11-08 18:26:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573084650] [2024-11-08 18:26:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573084650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:30,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:30,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821557827] [2024-11-08 18:26:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:30,671 INFO L87 Difference]: Start difference. First operand 625 states and 889 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-11-08 18:26:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:30,794 INFO L93 Difference]: Finished difference Result 1308 states and 1867 transitions. [2024-11-08 18:26:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:30,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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 111 [2024-11-08 18:26:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:30,798 INFO L225 Difference]: With dead ends: 1308 [2024-11-08 18:26:30,799 INFO L226 Difference]: Without dead ends: 897 [2024-11-08 18:26:30,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:30,800 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 674 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:30,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1803 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-08 18:26:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 682. [2024-11-08 18:26:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.42143906020558) internal successors, (968), 681 states have internal predecessors, (968), 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-11-08 18:26:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 968 transitions. [2024-11-08 18:26:30,817 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 968 transitions. Word has length 111 [2024-11-08 18:26:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:30,818 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 968 transitions. [2024-11-08 18:26:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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-11-08 18:26:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 968 transitions. [2024-11-08 18:26:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:26:30,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:30,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 18:26:30,820 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1205880070, now seen corresponding path program 1 times [2024-11-08 18:26:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373105818] [2024-11-08 18:26:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373105818] [2024-11-08 18:26:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373105818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330157400] [2024-11-08 18:26:31,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:31,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:31,576 INFO L87 Difference]: Start difference. First operand 682 states and 968 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-11-08 18:26:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:31,607 INFO L93 Difference]: Finished difference Result 1126 states and 1606 transitions. [2024-11-08 18:26:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2024-11-08 18:26:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:31,611 INFO L225 Difference]: With dead ends: 1126 [2024-11-08 18:26:31,611 INFO L226 Difference]: Without dead ends: 680 [2024-11-08 18:26:31,612 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-11-08 18:26:31,613 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 0 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:31,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1377 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-08 18:26:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-11-08 18:26:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.4167893961708395) internal successors, (962), 679 states have internal predecessors, (962), 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-11-08 18:26:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 962 transitions. [2024-11-08 18:26:31,627 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 962 transitions. Word has length 111 [2024-11-08 18:26:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:31,627 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 962 transitions. [2024-11-08 18:26:31,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-11-08 18:26:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 962 transitions. [2024-11-08 18:26:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:26:31,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:31,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:31,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:26:31,629 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1874444010, now seen corresponding path program 1 times [2024-11-08 18:26:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125062745] [2024-11-08 18:26:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125062745] [2024-11-08 18:26:32,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125062745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:32,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:32,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102332320] [2024-11-08 18:26:32,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:32,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:32,132 INFO L87 Difference]: Start difference. First operand 680 states and 962 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-11-08 18:26:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:32,179 INFO L93 Difference]: Finished difference Result 1120 states and 1592 transitions. [2024-11-08 18:26:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:32,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 111 [2024-11-08 18:26:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:32,182 INFO L225 Difference]: With dead ends: 1120 [2024-11-08 18:26:32,182 INFO L226 Difference]: Without dead ends: 680 [2024-11-08 18:26:32,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:32,184 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 1 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:32,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1814 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-08 18:26:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-11-08 18:26:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.4138438880706923) internal successors, (960), 679 states have internal predecessors, (960), 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-11-08 18:26:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 960 transitions. [2024-11-08 18:26:32,196 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 960 transitions. Word has length 111 [2024-11-08 18:26:32,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:32,196 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 960 transitions. [2024-11-08 18:26:32,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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-11-08 18:26:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 960 transitions. [2024-11-08 18:26:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 18:26:32,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:32,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:26:32,198 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash -995380728, now seen corresponding path program 1 times [2024-11-08 18:26:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250139490] [2024-11-08 18:26:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250139490] [2024-11-08 18:26:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250139490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882237472] [2024-11-08 18:26:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:32,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:32,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:32,442 INFO L87 Difference]: Start difference. First operand 680 states and 960 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-11-08 18:26:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:32,495 INFO L93 Difference]: Finished difference Result 1181 states and 1666 transitions. [2024-11-08 18:26:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:32,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2024-11-08 18:26:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:32,498 INFO L225 Difference]: With dead ends: 1181 [2024-11-08 18:26:32,498 INFO L226 Difference]: Without dead ends: 563 [2024-11-08 18:26:32,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:32,500 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 425 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:32,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 891 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-08 18:26:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2024-11-08 18:26:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.407473309608541) internal successors, (791), 562 states have internal predecessors, (791), 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-11-08 18:26:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 791 transitions. [2024-11-08 18:26:32,511 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 791 transitions. Word has length 111 [2024-11-08 18:26:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:32,511 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 791 transitions. [2024-11-08 18:26:32,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-11-08 18:26:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 791 transitions. [2024-11-08 18:26:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:26:32,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:32,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:32,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:26:32,513 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:32,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1790930442, now seen corresponding path program 1 times [2024-11-08 18:26:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336018660] [2024-11-08 18:26:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:32,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336018660] [2024-11-08 18:26:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336018660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:26:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349988810] [2024-11-08 18:26:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:26:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:33,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:26:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:26:33,789 INFO L87 Difference]: Start difference. First operand 563 states and 791 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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-11-08 18:26:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:33,968 INFO L93 Difference]: Finished difference Result 1159 states and 1645 transitions. [2024-11-08 18:26:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:26:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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 112 [2024-11-08 18:26:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:33,972 INFO L225 Difference]: With dead ends: 1159 [2024-11-08 18:26:33,972 INFO L226 Difference]: Without dead ends: 731 [2024-11-08 18:26:33,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:26:33,978 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 939 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2221 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:33,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2221 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-08 18:26:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 565. [2024-11-08 18:26:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4060283687943262) internal successors, (793), 564 states have internal predecessors, (793), 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-11-08 18:26:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 793 transitions. [2024-11-08 18:26:33,992 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 793 transitions. Word has length 112 [2024-11-08 18:26:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 793 transitions. [2024-11-08 18:26:33,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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-11-08 18:26:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 793 transitions. [2024-11-08 18:26:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:26:33,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:33,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:33,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 18:26:33,995 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:33,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 200753853, now seen corresponding path program 1 times [2024-11-08 18:26:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776951312] [2024-11-08 18:26:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776951312] [2024-11-08 18:26:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776951312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:34,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:26:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511176240] [2024-11-08 18:26:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:34,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:26:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:26:34,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:26:34,986 INFO L87 Difference]: Start difference. First operand 565 states and 793 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-11-08 18:26:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:35,731 INFO L93 Difference]: Finished difference Result 1194 states and 1698 transitions. [2024-11-08 18:26:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:26:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 112 [2024-11-08 18:26:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:35,735 INFO L225 Difference]: With dead ends: 1194 [2024-11-08 18:26:35,735 INFO L226 Difference]: Without dead ends: 769 [2024-11-08 18:26:35,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:26:35,736 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1114 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:35,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2920 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:26:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-08 18:26:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 569. [2024-11-08 18:26:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4049295774647887) internal successors, (798), 568 states have internal predecessors, (798), 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-11-08 18:26:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 798 transitions. [2024-11-08 18:26:35,752 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 798 transitions. Word has length 112 [2024-11-08 18:26:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:35,752 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 798 transitions. [2024-11-08 18:26:35,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-11-08 18:26:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 798 transitions. [2024-11-08 18:26:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:26:35,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:35,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 18:26:35,755 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:35,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash -792120110, now seen corresponding path program 1 times [2024-11-08 18:26:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982160919] [2024-11-08 18:26:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:36,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:36,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982160919] [2024-11-08 18:26:36,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982160919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:36,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:36,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:36,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962148721] [2024-11-08 18:26:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:36,075 INFO L87 Difference]: Start difference. First operand 569 states and 798 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-11-08 18:26:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:36,121 INFO L93 Difference]: Finished difference Result 1000 states and 1414 transitions. [2024-11-08 18:26:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 113 [2024-11-08 18:26:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:36,124 INFO L225 Difference]: With dead ends: 1000 [2024-11-08 18:26:36,125 INFO L226 Difference]: Without dead ends: 575 [2024-11-08 18:26:36,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:36,126 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 2 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:36,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1797 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-08 18:26:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 574. [2024-11-08 18:26:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4031413612565444) internal successors, (804), 573 states have internal predecessors, (804), 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-11-08 18:26:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 804 transitions. [2024-11-08 18:26:36,138 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 804 transitions. Word has length 113 [2024-11-08 18:26:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 804 transitions. [2024-11-08 18:26:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-11-08 18:26:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 804 transitions. [2024-11-08 18:26:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:26:36,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:36,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 18:26:36,140 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -446082194, now seen corresponding path program 1 times [2024-11-08 18:26:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838006148] [2024-11-08 18:26:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838006148] [2024-11-08 18:26:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838006148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549594630] [2024-11-08 18:26:36,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:36,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:36,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:36,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:36,904 INFO L87 Difference]: Start difference. First operand 574 states and 804 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-11-08 18:26:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:36,932 INFO L93 Difference]: Finished difference Result 1007 states and 1422 transitions. [2024-11-08 18:26:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 113 [2024-11-08 18:26:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:36,935 INFO L225 Difference]: With dead ends: 1007 [2024-11-08 18:26:36,935 INFO L226 Difference]: Without dead ends: 567 [2024-11-08 18:26:36,936 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-11-08 18:26:36,937 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:36,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1356 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-08 18:26:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2024-11-08 18:26:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.4028268551236749) internal successors, (794), 566 states have internal predecessors, (794), 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-11-08 18:26:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 794 transitions. [2024-11-08 18:26:36,948 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 794 transitions. Word has length 113 [2024-11-08 18:26:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:36,948 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 794 transitions. [2024-11-08 18:26:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-11-08 18:26:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 794 transitions. [2024-11-08 18:26:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 18:26:36,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:36,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:36,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 18:26:36,950 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:36,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1413382470, now seen corresponding path program 1 times [2024-11-08 18:26:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:36,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624297058] [2024-11-08 18:26:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:26:37,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:26:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:26:37,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:26:37,311 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:26:37,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:26:37,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 18:26:37,318 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, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:37,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:26:37,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:26:37 BoogieIcfgContainer [2024-11-08 18:26:37,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:26:37,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:26:37,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:26:37,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:26:37,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:04" (3/4) ... [2024-11-08 18:26:37,459 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:26:37,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:26:37,460 INFO L158 Benchmark]: Toolchain (without parser) took 37400.60ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 96.4MB in the beginning and 687.4MB in the end (delta: -591.0MB). Peak memory consumption was 762.7MB. Max. memory is 16.1GB. [2024-11-08 18:26:37,460 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 155.2MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:37,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.78ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 113.5MB in the end (delta: -17.5MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-11-08 18:26:37,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 269.93ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 71.7MB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-08 18:26:37,461 INFO L158 Benchmark]: Boogie Preprocessor took 416.63ms. Allocated memory was 155.2MB in the beginning and 241.2MB in the end (delta: 86.0MB). Free memory was 71.7MB in the beginning and 173.4MB in the end (delta: -101.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-08 18:26:37,461 INFO L158 Benchmark]: RCFGBuilder took 2397.72ms. Allocated memory was 241.2MB in the beginning and 411.0MB in the end (delta: 169.9MB). Free memory was 173.4MB in the beginning and 280.1MB in the end (delta: -106.7MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2024-11-08 18:26:37,462 INFO L158 Benchmark]: TraceAbstraction took 33423.67ms. Allocated memory was 411.0MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 280.1MB in the beginning and 687.4MB in the end (delta: -407.4MB). Peak memory consumption was 687.4MB. Max. memory is 16.1GB. [2024-11-08 18:26:37,462 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 1.5GB. Free memory is still 687.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:37,463 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.23ms. Allocated memory is still 155.2MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 877.78ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 113.5MB in the end (delta: -17.5MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 269.93ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 71.7MB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 416.63ms. Allocated memory was 155.2MB in the beginning and 241.2MB in the end (delta: 86.0MB). Free memory was 71.7MB in the beginning and 173.4MB in the end (delta: -101.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2397.72ms. Allocated memory was 241.2MB in the beginning and 411.0MB in the end (delta: 169.9MB). Free memory was 173.4MB in the beginning and 280.1MB in the end (delta: -106.7MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33423.67ms. Allocated memory was 411.0MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 280.1MB in the beginning and 687.4MB in the end (delta: -407.4MB). Peak memory consumption was 687.4MB. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 1.5GB. Free memory is still 687.4MB. 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 bitwiseOr at line 397, overapproximation of bitwiseAnd at line 437. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 2); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (2 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 4); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (4 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_10 var_11 = 0; [L39] const SORT_1 var_14 = 0; [L40] const SORT_4 var_16 = 0; [L41] const SORT_9 var_33 = 8; [L42] const SORT_9 var_40 = 7; [L43] const SORT_4 var_52 = 1; [L44] const SORT_1 var_56 = 1; [L45] const SORT_4 var_66 = 2; [L46] const SORT_9 var_72 = 0; [L47] const SORT_4 var_79 = 3; [L48] const SORT_9 var_98 = 5; [L49] const SORT_10 var_120 = 1; [L50] const SORT_9 var_122 = 15; [L51] const SORT_9 var_150 = 6; [L52] const SORT_9 var_315 = 1; [L54] SORT_1 input_2; [L55] SORT_1 input_3; [L56] SORT_4 input_5; [L57] SORT_1 input_6; [L58] SORT_1 input_7; [L59] SORT_1 input_8; [L60] SORT_4 input_103; [L61] SORT_10 input_116; [L62] SORT_10 input_117; [L63] SORT_10 input_118; [L64] SORT_10 input_119; [L65] SORT_10 input_128; [L66] SORT_10 input_135; [L67] SORT_10 input_142; [L68] SORT_10 input_143; [L69] SORT_10 input_144; [L70] SORT_10 input_149; [L71] SORT_10 input_153; [L72] SORT_10 input_159; [L73] SORT_4 input_174; [L74] SORT_4 input_175; [L75] SORT_4 input_176; [L76] SORT_4 input_177; [L77] SORT_4 input_184; [L78] SORT_4 input_187; [L79] SORT_4 input_195; [L80] SORT_4 input_202; [L81] SORT_4 input_203; [L82] SORT_4 input_204; [L83] SORT_4 input_207; [L84] SORT_4 input_209; [L85] SORT_4 input_214; [L86] SORT_4 input_223; [L87] SORT_1 input_235; [L88] SORT_1 input_236; [L89] SORT_1 input_237; [L90] SORT_1 input_238; [L91] SORT_1 input_245; [L92] SORT_1 input_248; [L93] SORT_1 input_251; [L94] SORT_1 input_261; [L95] SORT_4 input_276; [L96] SORT_4 input_280; [L97] SORT_4 input_281; [L98] SORT_4 input_282; [L99] SORT_4 input_283; [L100] SORT_4 input_287; [L101] SORT_4 input_292; [L102] SORT_4 input_301; [L103] SORT_9 input_311; [L104] SORT_9 input_312; [L105] SORT_9 input_313; [L106] SORT_9 input_314; [L107] SORT_9 input_320; [L108] SORT_9 input_326; [L109] SORT_9 input_333; [L110] SORT_9 input_334; [L111] SORT_9 input_335; [L112] SORT_9 input_338; [L113] SORT_9 input_340; [L114] SORT_9 input_344; [L115] SORT_9 input_345; [L116] SORT_9 input_349; [L117] SORT_9 input_354; [L118] SORT_9 input_372; [L119] SORT_9 input_373; [L120] SORT_9 input_374; [L121] SORT_9 input_375; [L122] SORT_9 input_380; [L123] SORT_9 input_383; [L124] SORT_9 input_391; [L125] SORT_9 input_398; [L126] SORT_9 input_399; [L127] SORT_9 input_400; [L128] SORT_9 input_403; [L129] SORT_9 input_405; [L130] SORT_9 input_410; [L131] SORT_9 input_419; [L132] SORT_9 input_430; [L133] SORT_9 input_431; [L134] SORT_9 input_432; [L135] SORT_9 input_433; [L136] SORT_9 input_438; [L137] SORT_9 input_441; [L138] SORT_9 input_444; [L139] SORT_9 input_454; [L141] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L141] SORT_10 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L142] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L142] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L143] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L143] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L144] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L144] SORT_4 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L145] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L145] SORT_9 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L146] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L146] SORT_4 state_96 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L147] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L147] SORT_9 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L148] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L148] SORT_9 state_113 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L150] SORT_10 init_13_arg_1 = var_11; [L151] state_12 = init_13_arg_1 [L152] SORT_4 init_18_arg_1 = var_16; [L153] state_17 = init_18_arg_1 [L154] SORT_1 init_23_arg_1 = var_14; [L155] state_22 = init_23_arg_1 [L156] SORT_4 init_51_arg_1 = var_16; [L157] state_50 = init_51_arg_1 [L158] SORT_9 init_74_arg_1 = var_72; [L159] state_73 = init_74_arg_1 [L160] SORT_9 init_112_arg_1 = var_72; [L161] state_111 = init_112_arg_1 [L162] SORT_9 init_114_arg_1 = var_72; [L163] state_113 = init_114_arg_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L166] input_2 = __VERIFIER_nondet_uchar() [L167] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L167] input_2 = input_2 & mask_SORT_1 [L168] input_3 = __VERIFIER_nondet_uchar() [L169] input_5 = __VERIFIER_nondet_uchar() [L170] input_6 = __VERIFIER_nondet_uchar() [L171] EXPR input_6 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L171] input_6 = input_6 & mask_SORT_1 [L172] input_7 = __VERIFIER_nondet_uchar() [L173] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_6=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L173] input_7 = input_7 & mask_SORT_1 [L174] input_8 = __VERIFIER_nondet_uchar() [L175] EXPR input_8 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L175] input_8 = input_8 & mask_SORT_1 [L176] input_103 = __VERIFIER_nondet_uchar() [L177] input_116 = __VERIFIER_nondet_uchar() [L178] input_117 = __VERIFIER_nondet_uchar() [L179] input_118 = __VERIFIER_nondet_uchar() [L180] input_119 = __VERIFIER_nondet_uchar() [L181] input_128 = __VERIFIER_nondet_uchar() [L182] input_135 = __VERIFIER_nondet_uchar() [L183] input_142 = __VERIFIER_nondet_uchar() [L184] input_143 = __VERIFIER_nondet_uchar() [L185] input_144 = __VERIFIER_nondet_uchar() [L186] input_149 = __VERIFIER_nondet_uchar() [L187] input_153 = __VERIFIER_nondet_uchar() [L188] input_159 = __VERIFIER_nondet_uchar() [L189] input_174 = __VERIFIER_nondet_uchar() [L190] input_175 = __VERIFIER_nondet_uchar() [L191] input_176 = __VERIFIER_nondet_uchar() [L192] input_177 = __VERIFIER_nondet_uchar() [L193] input_184 = __VERIFIER_nondet_uchar() [L194] input_187 = __VERIFIER_nondet_uchar() [L195] input_195 = __VERIFIER_nondet_uchar() [L196] input_202 = __VERIFIER_nondet_uchar() [L197] input_203 = __VERIFIER_nondet_uchar() [L198] input_204 = __VERIFIER_nondet_uchar() [L199] input_207 = __VERIFIER_nondet_uchar() [L200] input_209 = __VERIFIER_nondet_uchar() [L201] input_214 = __VERIFIER_nondet_uchar() [L202] input_223 = __VERIFIER_nondet_uchar() [L203] input_235 = __VERIFIER_nondet_uchar() [L204] input_236 = __VERIFIER_nondet_uchar() [L205] input_237 = __VERIFIER_nondet_uchar() [L206] input_238 = __VERIFIER_nondet_uchar() [L207] input_245 = __VERIFIER_nondet_uchar() [L208] input_248 = __VERIFIER_nondet_uchar() [L209] input_251 = __VERIFIER_nondet_uchar() [L210] input_261 = __VERIFIER_nondet_uchar() [L211] input_276 = __VERIFIER_nondet_uchar() [L212] input_280 = __VERIFIER_nondet_uchar() [L213] input_281 = __VERIFIER_nondet_uchar() [L214] input_282 = __VERIFIER_nondet_uchar() [L215] input_283 = __VERIFIER_nondet_uchar() [L216] input_287 = __VERIFIER_nondet_uchar() [L217] input_292 = __VERIFIER_nondet_uchar() [L218] input_301 = __VERIFIER_nondet_uchar() [L219] input_311 = __VERIFIER_nondet_uchar() [L220] input_312 = __VERIFIER_nondet_uchar() [L221] input_313 = __VERIFIER_nondet_uchar() [L222] input_314 = __VERIFIER_nondet_uchar() [L223] input_320 = __VERIFIER_nondet_uchar() [L224] input_326 = __VERIFIER_nondet_uchar() [L225] input_333 = __VERIFIER_nondet_uchar() [L226] input_334 = __VERIFIER_nondet_uchar() [L227] input_335 = __VERIFIER_nondet_uchar() [L228] input_338 = __VERIFIER_nondet_uchar() [L229] input_340 = __VERIFIER_nondet_uchar() [L230] input_344 = __VERIFIER_nondet_uchar() [L231] input_345 = __VERIFIER_nondet_uchar() [L232] input_349 = __VERIFIER_nondet_uchar() [L233] input_354 = __VERIFIER_nondet_uchar() [L234] input_372 = __VERIFIER_nondet_uchar() [L235] input_373 = __VERIFIER_nondet_uchar() [L236] input_374 = __VERIFIER_nondet_uchar() [L237] input_375 = __VERIFIER_nondet_uchar() [L238] input_380 = __VERIFIER_nondet_uchar() [L239] input_383 = __VERIFIER_nondet_uchar() [L240] input_391 = __VERIFIER_nondet_uchar() [L241] input_398 = __VERIFIER_nondet_uchar() [L242] input_399 = __VERIFIER_nondet_uchar() [L243] input_400 = __VERIFIER_nondet_uchar() [L244] input_403 = __VERIFIER_nondet_uchar() [L245] input_405 = __VERIFIER_nondet_uchar() [L246] input_410 = __VERIFIER_nondet_uchar() [L247] input_419 = __VERIFIER_nondet_uchar() [L248] input_430 = __VERIFIER_nondet_uchar() [L249] input_431 = __VERIFIER_nondet_uchar() [L250] input_432 = __VERIFIER_nondet_uchar() [L251] input_433 = __VERIFIER_nondet_uchar() [L252] input_438 = __VERIFIER_nondet_uchar() [L253] input_441 = __VERIFIER_nondet_uchar() [L254] input_444 = __VERIFIER_nondet_uchar() [L255] input_454 = __VERIFIER_nondet_uchar() [L258] SORT_1 var_15_arg_0 = var_14; [L259] SORT_10 var_15_arg_1 = state_12; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L260] EXPR ((SORT_9)var_15_arg_0 << 3) | var_15_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L260] SORT_9 var_15 = ((SORT_9)var_15_arg_0 << 3) | var_15_arg_1; [L261] SORT_4 var_19_arg_0 = state_17; [L262] SORT_1 var_19_arg_1 = var_14; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_19_arg_0=0, var_19_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L263] EXPR ((SORT_10)var_19_arg_0 << 1) | var_19_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L263] SORT_10 var_19 = ((SORT_10)var_19_arg_0 << 1) | var_19_arg_1; [L264] EXPR var_19 & mask_SORT_10 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L264] var_19 = var_19 & mask_SORT_10 [L265] SORT_1 var_20_arg_0 = var_14; [L266] SORT_10 var_20_arg_1 = var_19; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_20_arg_0=0, var_20_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L267] EXPR ((SORT_9)var_20_arg_0 << 3) | var_20_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L267] SORT_9 var_20 = ((SORT_9)var_20_arg_0 << 3) | var_20_arg_1; [L268] SORT_9 var_21_arg_0 = var_15; [L269] SORT_9 var_21_arg_1 = var_20; [L270] SORT_9 var_21 = var_21_arg_0 + var_21_arg_1; [L271] SORT_1 var_24_arg_0 = var_14; [L272] SORT_1 var_24_arg_1 = state_22; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_24_arg_0=0, var_24_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L273] EXPR ((SORT_4)var_24_arg_0 << 1) | var_24_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L273] SORT_4 var_24 = ((SORT_4)var_24_arg_0 << 1) | var_24_arg_1; [L274] EXPR var_24 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L274] var_24 = var_24 & mask_SORT_4 [L275] SORT_1 var_25_arg_0 = state_22; [L276] SORT_4 var_25_arg_1 = var_24; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_25_arg_0=0, var_25_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L277] EXPR ((SORT_10)var_25_arg_0 << 2) | var_25_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L277] SORT_10 var_25 = ((SORT_10)var_25_arg_0 << 2) | var_25_arg_1; [L278] EXPR var_25 & mask_SORT_10 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L278] var_25 = var_25 & mask_SORT_10 [L279] SORT_1 var_26_arg_0 = var_14; [L280] SORT_10 var_26_arg_1 = var_25; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_26_arg_0=0, var_26_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L281] EXPR ((SORT_9)var_26_arg_0 << 3) | var_26_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L281] SORT_9 var_26 = ((SORT_9)var_26_arg_0 << 3) | var_26_arg_1; [L282] SORT_9 var_27_arg_0 = var_21; [L283] SORT_9 var_27_arg_1 = var_26; [L284] SORT_9 var_27 = var_27_arg_0 + var_27_arg_1; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L285] EXPR var_27 & mask_SORT_9 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L285] var_27 = var_27 & mask_SORT_9 [L286] SORT_9 var_28_arg_0 = var_27; [L287] SORT_1 var_28 = var_28_arg_0 >> 3; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L288] EXPR var_28 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L288] var_28 = var_28 & mask_SORT_1 [L289] SORT_1 var_29_arg_0 = var_28; [L290] SORT_1 var_29_arg_1 = var_14; [L291] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L292] SORT_9 var_30_arg_0 = var_27; [L293] SORT_4 var_30 = var_30_arg_0 >> 1; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_29=1, var_30=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L294] EXPR var_30 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_29=1, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L294] var_30 = var_30 & mask_SORT_4 [L295] SORT_4 var_31_arg_0 = var_30; [L296] SORT_4 var_31_arg_1 = var_16; [L297] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L298] SORT_1 var_32_arg_0 = var_29; [L299] SORT_1 var_32_arg_1 = var_31; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32_arg_0=1, var_32_arg_1=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L300] EXPR var_32_arg_0 | var_32_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L300] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L301] SORT_9 var_34_arg_0 = var_27; [L302] SORT_9 var_34_arg_1 = var_33; [L303] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L304] SORT_1 var_35_arg_0 = var_34; [L305] SORT_1 var_35 = ~var_35_arg_0; [L306] SORT_10 var_36_arg_0 = state_12; [L307] SORT_10 var_36_arg_1 = var_11; [L308] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L309] SORT_1 var_37_arg_0 = var_36; [L310] SORT_1 var_37 = ~var_37_arg_0; [L311] SORT_1 var_38_arg_0 = var_35; [L312] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32=1, var_33=8, var_38_arg_0=-1, var_38_arg_1=-2, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L313] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L313] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L314] SORT_1 var_39_arg_0 = var_32; [L315] SORT_1 var_39_arg_1 = var_38; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39_arg_0=1, var_39_arg_1=256, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L316] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L316] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L317] SORT_9 var_41_arg_0 = var_27; [L318] SORT_9 var_41_arg_1 = var_40; [L319] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L320] SORT_1 var_42_arg_0 = var_41; [L321] SORT_1 var_42 = ~var_42_arg_0; [L322] SORT_10 var_43_arg_0 = state_12; [L323] SORT_10 var_43_arg_1 = var_11; [L324] SORT_1 var_43 = var_43_arg_0 == var_43_arg_1; [L325] SORT_1 var_44_arg_0 = var_43; [L326] SORT_1 var_44 = ~var_44_arg_0; [L327] SORT_4 var_45_arg_0 = state_17; [L328] SORT_4 var_45_arg_1 = var_16; [L329] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L330] SORT_1 var_46_arg_0 = var_45; [L331] SORT_1 var_46 = ~var_46_arg_0; [L332] SORT_1 var_47_arg_0 = var_44; [L333] SORT_1 var_47_arg_1 = var_46; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_42=-1, var_47_arg_0=-2, var_47_arg_1=-2, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L334] EXPR var_47_arg_0 | var_47_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_42=-1, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L334] SORT_1 var_47 = var_47_arg_0 | var_47_arg_1; [L335] SORT_1 var_48_arg_0 = var_42; [L336] SORT_1 var_48_arg_1 = var_47; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_48_arg_0=-1, var_48_arg_1=254, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L337] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L337] SORT_1 var_48 = var_48_arg_0 | var_48_arg_1; [L338] SORT_1 var_49_arg_0 = var_39; [L339] SORT_1 var_49_arg_1 = var_48; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49_arg_0=0, var_49_arg_1=256, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L340] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L340] SORT_1 var_49 = var_49_arg_0 & var_49_arg_1; [L341] SORT_4 var_53_arg_0 = state_50; [L342] SORT_4 var_53_arg_1 = var_52; [L343] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L344] SORT_9 var_54_arg_0 = var_27; [L345] SORT_9 var_54_arg_1 = var_40; [L346] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L347] SORT_1 var_55_arg_0 = var_53; [L348] SORT_1 var_55_arg_1 = var_54; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_55_arg_0=0, var_55_arg_1=0, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L349] EXPR var_55_arg_0 & var_55_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L349] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L350] SORT_1 var_57_arg_0 = var_28; [L351] SORT_1 var_57_arg_1 = var_56; [L352] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L353] SORT_1 var_58_arg_0 = var_55; [L354] SORT_1 var_58_arg_1 = var_57; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_58_arg_0=0, var_58_arg_1=0, var_66=2, var_72=0, var_79=3, var_98=5] [L355] EXPR var_58_arg_0 | var_58_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L355] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L356] SORT_1 var_59_arg_0 = var_58; [L357] SORT_1 var_59 = ~var_59_arg_0; [L358] SORT_10 var_60_arg_0 = state_12; [L359] SORT_10 var_60_arg_1 = var_11; [L360] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L361] SORT_4 var_61_arg_0 = state_17; [L362] SORT_4 var_61_arg_1 = var_16; [L363] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L364] SORT_1 var_62_arg_0 = var_60; [L365] SORT_1 var_62_arg_1 = var_61; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_59=-1, var_62_arg_0=1, var_62_arg_1=1, var_66=2, var_72=0, var_79=3, var_98=5] [L366] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_59=-1, var_66=2, var_72=0, var_79=3, var_98=5] [L366] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L367] SORT_1 var_63_arg_0 = var_62; [L368] SORT_1 var_63 = ~var_63_arg_0; [L369] SORT_1 var_64_arg_0 = var_59; [L370] SORT_1 var_64_arg_1 = var_63; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_64_arg_0=-1, var_64_arg_1=-2, var_66=2, var_72=0, var_79=3, var_98=5] [L371] EXPR var_64_arg_0 | var_64_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L371] SORT_1 var_64 = var_64_arg_0 | var_64_arg_1; [L372] SORT_1 var_65_arg_0 = var_49; [L373] SORT_1 var_65_arg_1 = var_64; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65_arg_0=0, var_65_arg_1=256, var_66=2, var_72=0, var_79=3, var_98=5] [L374] EXPR var_65_arg_0 & var_65_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L374] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L375] SORT_4 var_67_arg_0 = state_50; [L376] SORT_4 var_67_arg_1 = var_66; [L377] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L378] SORT_1 var_68_arg_0 = var_67; [L379] SORT_1 var_68 = ~var_68_arg_0; [L380] SORT_1 var_69_arg_0 = state_22; [L381] SORT_1 var_69_arg_1 = var_14; [L382] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L383] SORT_10 var_70_arg_0 = state_12; [L384] SORT_10 var_70_arg_1 = var_11; [L385] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L386] SORT_1 var_71_arg_0 = var_69; [L387] SORT_1 var_71_arg_1 = var_70; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_71_arg_0=1, var_71_arg_1=1, var_72=0, var_79=3, var_98=5] [L388] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_79=3, var_98=5] [L388] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L389] SORT_9 var_75_arg_0 = state_73; [L390] SORT_9 var_75_arg_1 = var_72; [L391] SORT_1 var_75 = var_75_arg_0 == var_75_arg_1; [L392] SORT_1 var_76_arg_0 = var_71; [L393] SORT_1 var_76_arg_1 = var_75; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_76_arg_0=1, var_76_arg_1=1, var_79=3, var_98=5] [L394] EXPR var_76_arg_0 & var_76_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_79=3, var_98=5] [L394] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L395] SORT_1 var_77_arg_0 = var_68; [L396] SORT_1 var_77_arg_1 = var_76; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_72=0, var_77_arg_0=-1, var_77_arg_1=1, var_79=3, var_98=5] [L397] EXPR var_77_arg_0 | var_77_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_72=0, var_79=3, var_98=5] [L397] SORT_1 var_77 = var_77_arg_0 | var_77_arg_1; [L398] SORT_1 var_78_arg_0 = var_65; [L399] SORT_1 var_78_arg_1 = var_77; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78_arg_0=0, var_78_arg_1=256, var_79=3, var_98=5] [L400] EXPR var_78_arg_0 & var_78_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L400] SORT_1 var_78 = var_78_arg_0 & var_78_arg_1; [L401] SORT_4 var_80_arg_0 = state_50; [L402] SORT_4 var_80_arg_1 = var_79; [L403] SORT_1 var_80 = var_80_arg_0 == var_80_arg_1; [L404] SORT_1 var_81_arg_0 = var_80; [L405] SORT_1 var_81 = ~var_81_arg_0; [L406] SORT_9 var_82_arg_0 = var_27; [L407] SORT_4 var_82 = var_82_arg_0 >> 2; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_82=0, var_98=5] [L408] EXPR var_82 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_98=5] [L408] var_82 = var_82 & mask_SORT_4 [L409] SORT_4 var_83_arg_0 = var_82; [L410] SORT_4 var_83_arg_1 = var_52; [L411] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L412] SORT_9 var_84_arg_0 = var_27; [L413] SORT_4 var_84 = var_84_arg_0 >> 0; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_84=0, var_98=5] [L414] EXPR var_84 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_98=5] [L414] var_84 = var_84 & mask_SORT_4 [L415] SORT_4 var_85_arg_0 = var_84; [L416] SORT_4 var_85_arg_1 = var_52; [L417] SORT_1 var_85 = var_85_arg_0 == var_85_arg_1; [L418] SORT_4 var_86_arg_0 = var_84; [L419] SORT_4 var_86_arg_1 = var_66; [L420] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L421] SORT_1 var_87_arg_0 = var_85; [L422] SORT_1 var_87_arg_1 = var_86; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_87_arg_0=0, var_87_arg_1=0, var_98=5] [L423] EXPR var_87_arg_0 | var_87_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_98=5] [L423] SORT_1 var_87 = var_87_arg_0 | var_87_arg_1; [L424] SORT_1 var_88_arg_0 = var_83; [L425] SORT_1 var_88_arg_1 = var_87; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_88_arg_0=0, var_88_arg_1=0, var_98=5] [L426] EXPR var_88_arg_0 & var_88_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_98=5] [L426] SORT_1 var_88 = var_88_arg_0 & var_88_arg_1; [L427] SORT_1 var_89_arg_0 = var_81; [L428] SORT_1 var_89_arg_1 = var_88; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_89_arg_0=-1, var_89_arg_1=0, var_98=5] [L429] EXPR var_89_arg_0 | var_89_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_98=5] [L429] SORT_1 var_89 = var_89_arg_0 | var_89_arg_1; [L430] SORT_1 var_90_arg_0 = var_78; [L431] SORT_1 var_90_arg_1 = var_89; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_90_arg_0=0, var_90_arg_1=255, var_98=5] [L432] EXPR var_90_arg_0 & var_90_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L432] SORT_1 var_90 = var_90_arg_0 & var_90_arg_1; [L433] SORT_1 var_93_arg_0 = var_90; [L434] SORT_1 var_93 = ~var_93_arg_0; [L435] SORT_1 var_94_arg_0 = var_56; [L436] SORT_1 var_94_arg_1 = var_93; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_94_arg_0=1, var_94_arg_1=-1, var_98=5] [L437] EXPR var_94_arg_0 & var_94_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L437] SORT_1 var_94 = var_94_arg_0 & var_94_arg_1; [L438] EXPR var_94 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L438] var_94 = var_94 & mask_SORT_1 [L439] SORT_1 bad_95_arg_0 = var_94; [L440] CALL __VERIFIER_assert(!(bad_95_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 326 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15138 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15138 mSDsluCounter, 60636 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46519 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3647 IncrementalHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 14117 mSDtfsCounter, 3647 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=19, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 1804 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 3448 NumberOfCodeBlocks, 3448 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3303 ConstructedInterpolants, 0 QuantifiedInterpolants, 9705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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-11-08 18:26:37,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:26:40,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:26:40,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:26:40,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:26:40,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:26:40,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:26:40,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:26:40,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:26:40,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:26:40,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:26:40,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:26:40,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:26:40,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:26:40,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:26:40,251 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:26:40,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:26:40,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:26:40,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:26:40,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:26:40,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:26:40,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:26:40,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:26:40,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:26:40,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:26:40,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:26:40,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:26:40,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:26:40,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:26:40,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:26:40,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:26:40,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:26:40,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:40,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:26:40,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:26:40,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:26:40,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:26:40,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:26:40,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:26:40,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:26:40,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:26:40,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:26:40,267 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 [2024-11-08 18:26:40,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:26:40,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:26:40,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:26:40,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:26:40,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:26:40,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-08 18:26:42,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:26:42,626 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:26:42,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-08 18:26:42,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff182d33b/4111139c7e574b2bb86c307091325f6a/FLAG9cd0a2a22 [2024-11-08 18:26:42,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff182d33b/4111139c7e574b2bb86c307091325f6a [2024-11-08 18:26:42,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:26:42,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:26:42,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:42,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:26:42,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:26:42,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:42" (1/1) ... [2024-11-08 18:26:42,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb3126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:42, skipping insertion in model container [2024-11-08 18:26:42,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:42" (1/1) ... [2024-11-08 18:26:43,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:26:43,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-08 18:26:43,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:43,588 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:26:43,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-08 18:26:43,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:43,742 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:26:43,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43 WrapperNode [2024-11-08 18:26:43,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:43,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:43,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:26:43,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:26:43,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,881 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1586 [2024-11-08 18:26:43,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:43,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:26:43,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:26:43,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:26:43,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:26:43,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:43,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:44,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:44,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:44,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:44,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:26:44,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:26:44,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:26:44,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:26:44,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (1/1) ... [2024-11-08 18:26:44,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:44,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:26:44,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:26:44,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:26:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:26:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:26:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:26:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:26:44,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:26:44,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:26:45,597 INFO L? ?]: Removed 272 outVars from TransFormulas that were not future-live. [2024-11-08 18:26:45,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:26:45,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:26:45,610 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:26:45,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:45 BoogieIcfgContainer [2024-11-08 18:26:45,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:26:45,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:26:45,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:26:45,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:26:45,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:26:42" (1/3) ... [2024-11-08 18:26:45,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2add38dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:45, skipping insertion in model container [2024-11-08 18:26:45,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:43" (2/3) ... [2024-11-08 18:26:45,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2add38dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:45, skipping insertion in model container [2024-11-08 18:26:45,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:45" (3/3) ... [2024-11-08 18:26:45,620 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2024-11-08 18:26:45,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:26:45,638 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:26:45,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:26:45,704 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;@6c309acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:26:45,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:26:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-11-08 18:26:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:26:45,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:45,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:26:45,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:45,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:26:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:26:45,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806103842] [2024-11-08 18:26:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:45,739 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-11-08 18:26:45,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:26:45,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-08 18:26:45,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 18:26:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:46,361 WARN L253 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 18:26:46,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:48,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:26:48,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:26:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806103842] [2024-11-08 18:26:48,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806103842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:48,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:48,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805305202] [2024-11-08 18:26:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:48,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:26:48,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:48,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:48,340 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-08 18:26:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:48,500 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 18:26:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:48,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 18:26:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:48,511 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:26:48,511 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 18:26:48,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:48,518 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:48,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 18:26:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 18:26:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-11-08 18:26:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:26:48,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:26:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:26:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-08 18:26:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:26:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:26:48,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:48,570 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:48,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-08 18:26:48,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-08 18:26:48,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:48,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 18:26:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:26:48,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664920509] [2024-11-08 18:26:48,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:48,775 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-11-08 18:26:48,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:26:48,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-08 18:26:48,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 18:26:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:49,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 180 conjuncts are in the unsatisfiable core [2024-11-08 18:26:49,644 INFO L278 TraceCheckSpWp]: Computing forward predicates...