./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 3289d67d 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:05:52,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:05:53,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:05:53,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:05:53,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:05:53,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:05:53,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:05:53,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:05:53,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:05:53,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:05:53,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:05:53,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:05:53,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:05:53,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:05:53,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:05:53,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:05:53,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:05:53,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:05:53,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:05:53,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:05:53,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:05:53,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:05:53,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:05:53,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:05:53,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:05:53,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:05:53,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:05:53,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:05:53,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:05:53,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:05:53,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:05:53,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:05:53,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:05:53,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:05:53,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:05:53,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:05:53,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:05:53,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:05:53,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:05:53,080 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-16 11:05:53,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:05:53,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:05:53,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:05:53,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:05:53,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:05:53,363 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-16 11:05:54,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:05:55,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:05:55,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-16 11:05:55,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc92cd20/8943c8abfdf046828f6492e89a6b70b2/FLAG8eaca58a8 [2024-11-16 11:05:55,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebc92cd20/8943c8abfdf046828f6492e89a6b70b2 [2024-11-16 11:05:55,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:05:55,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:05:55,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:05:55,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:05:55,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:05:55,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:55,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5591fd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55, skipping insertion in model container [2024-11-16 11:05:55,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:55,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:05:55,444 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-16 11:05:55,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:05:55,740 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:05:55,749 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-16 11:05:55,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:05:55,979 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:05:55,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55 WrapperNode [2024-11-16 11:05:55,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:05:55,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:05:55,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:05:55,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:05:55,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,211 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2217 [2024-11-16 11:05:56,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:05:56,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:05:56,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:05:56,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:05:56,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,335 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-16 11:05:56,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:05:56,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:05:56,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:05:56,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:05:56,553 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (1/1) ... [2024-11-16 11:05:56,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:05:56,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:05:56,588 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-16 11:05:56,590 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-16 11:05:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:05:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:05:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:05:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:05:57,022 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:05:57,024 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:05:58,884 INFO L? ?]: Removed 1503 outVars from TransFormulas that were not future-live. [2024-11-16 11:05:58,884 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:05:58,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:05:58,980 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:05:58,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:05:58 BoogieIcfgContainer [2024-11-16 11:05:58,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:05:58,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:05:58,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:05:58,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:05:58,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:05:55" (1/3) ... [2024-11-16 11:05:58,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f512d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:05:58, skipping insertion in model container [2024-11-16 11:05:58,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:05:55" (2/3) ... [2024-11-16 11:05:58,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f512d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:05:58, skipping insertion in model container [2024-11-16 11:05:58,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:05:58" (3/3) ... [2024-11-16 11:05:58,990 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2024-11-16 11:05:59,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:05:59,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:05:59,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:05:59,087 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;@36b9462e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:05:59,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:05:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 329 states, 327 states have (on average 1.492354740061162) internal successors, (488), 328 states have internal predecessors, (488), 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-16 11:05:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 11:05:59,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:05:59,109 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-16 11:05:59,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:05:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:05:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash 94084971, now seen corresponding path program 1 times [2024-11-16 11:05:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:05:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035577616] [2024-11-16 11:05:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:05:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:05:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:00,385 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-16 11:06:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035577616] [2024-11-16 11:06:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035577616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:00,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371232317] [2024-11-16 11:06:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:00,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:00,424 INFO L87 Difference]: Start difference. First operand has 329 states, 327 states have (on average 1.492354740061162) internal successors, (488), 328 states have internal predecessors, (488), 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 25.0) internal successors, (100), 4 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-16 11:06:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:00,683 INFO L93 Difference]: Finished difference Result 621 states and 925 transitions. [2024-11-16 11:06:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-16 11:06:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:00,701 INFO L225 Difference]: With dead ends: 621 [2024-11-16 11:06:00,701 INFO L226 Difference]: Without dead ends: 326 [2024-11-16 11:06:00,705 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-16 11:06:00,711 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:00,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1198 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-16 11:06:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-16 11:06:00,763 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-16 11:06:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-11-16 11:06:00,767 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 100 [2024-11-16 11:06:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:00,768 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-11-16 11:06:00,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 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-16 11:06:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-11-16 11:06:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 11:06:00,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:00,775 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-16 11:06:00,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:06:00,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:00,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1233279594, now seen corresponding path program 1 times [2024-11-16 11:06:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:00,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914109845] [2024-11-16 11:06:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:01,290 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-16 11:06:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914109845] [2024-11-16 11:06:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914109845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118906405] [2024-11-16 11:06:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:01,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:01,296 INFO L87 Difference]: Start difference. First operand 326 states and 484 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-16 11:06:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:01,492 INFO L93 Difference]: Finished difference Result 620 states and 921 transitions. [2024-11-16 11:06:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:01,493 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-16 11:06:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:01,496 INFO L225 Difference]: With dead ends: 620 [2024-11-16 11:06:01,497 INFO L226 Difference]: Without dead ends: 328 [2024-11-16 11:06:01,498 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-16 11:06:01,501 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1195 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-16 11:06:01,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1195 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-16 11:06:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-16 11:06:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.4862385321100917) internal successors, (486), 327 states have internal predecessors, (486), 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-16 11:06:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 486 transitions. [2024-11-16 11:06:01,528 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 486 transitions. Word has length 101 [2024-11-16 11:06:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 486 transitions. [2024-11-16 11:06:01,529 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-16 11:06:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 486 transitions. [2024-11-16 11:06:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 11:06:01,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:01,533 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-16 11:06:01,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:06:01,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 170282032, now seen corresponding path program 1 times [2024-11-16 11:06:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779410154] [2024-11-16 11:06:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:02,217 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-16 11:06:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779410154] [2024-11-16 11:06:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779410154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984627427] [2024-11-16 11:06:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:02,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:02,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:02,220 INFO L87 Difference]: Start difference. First operand 328 states and 486 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-16 11:06:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:02,480 INFO L93 Difference]: Finished difference Result 626 states and 928 transitions. [2024-11-16 11:06:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-16 11:06:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:02,483 INFO L225 Difference]: With dead ends: 626 [2024-11-16 11:06:02,483 INFO L226 Difference]: Without dead ends: 332 [2024-11-16 11:06:02,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-16 11:06:02,485 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 395 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:02,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1188 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-16 11:06:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2024-11-16 11:06:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.481818181818182) internal successors, (489), 330 states have internal predecessors, (489), 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-16 11:06:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 489 transitions. [2024-11-16 11:06:02,502 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 489 transitions. Word has length 102 [2024-11-16 11:06:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:02,502 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 489 transitions. [2024-11-16 11:06:02,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-16 11:06:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 489 transitions. [2024-11-16 11:06:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 11:06:02,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:02,504 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-16 11:06:02,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:06:02,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:02,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1519681412, now seen corresponding path program 1 times [2024-11-16 11:06:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:02,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426338200] [2024-11-16 11:06:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:03,682 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-16 11:06:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426338200] [2024-11-16 11:06:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426338200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:06:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333777413] [2024-11-16 11:06:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:06:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:06:03,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:06:03,687 INFO L87 Difference]: Start difference. First operand 331 states and 489 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-16 11:06:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:04,650 INFO L93 Difference]: Finished difference Result 924 states and 1366 transitions. [2024-11-16 11:06:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:06:04,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-16 11:06:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:04,655 INFO L225 Difference]: With dead ends: 924 [2024-11-16 11:06:04,655 INFO L226 Difference]: Without dead ends: 627 [2024-11-16 11:06:04,657 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-16 11:06:04,661 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1277 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:04,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1857 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 11:06:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-16 11:06:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 448. [2024-11-16 11:06:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.483221476510067) internal successors, (663), 447 states have internal predecessors, (663), 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-16 11:06:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 663 transitions. [2024-11-16 11:06:04,681 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 663 transitions. Word has length 103 [2024-11-16 11:06:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:04,681 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 663 transitions. [2024-11-16 11:06:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 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-16 11:06:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 663 transitions. [2024-11-16 11:06:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 11:06:04,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:04,684 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-16 11:06:04,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:06:04,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1384203322, now seen corresponding path program 1 times [2024-11-16 11:06:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427765976] [2024-11-16 11:06:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:05,589 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-16 11:06:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427765976] [2024-11-16 11:06:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427765976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:05,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:05,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:06:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607663128] [2024-11-16 11:06:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:05,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:06:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:06:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:06:05,594 INFO L87 Difference]: Start difference. First operand 448 states and 663 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 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-16 11:06:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:06,286 INFO L93 Difference]: Finished difference Result 927 states and 1369 transitions. [2024-11-16 11:06:06,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:06:06,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 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-16 11:06:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:06,289 INFO L225 Difference]: With dead ends: 927 [2024-11-16 11:06:06,289 INFO L226 Difference]: Without dead ends: 630 [2024-11-16 11:06:06,290 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-16 11:06:06,291 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 1276 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:06,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1509 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:06:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-16 11:06:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 475. [2024-11-16 11:06:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 1.481012658227848) internal successors, (702), 474 states have internal predecessors, (702), 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-16 11:06:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 702 transitions. [2024-11-16 11:06:06,302 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 702 transitions. Word has length 104 [2024-11-16 11:06:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:06,302 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 702 transitions. [2024-11-16 11:06:06,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 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-16 11:06:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 702 transitions. [2024-11-16 11:06:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 11:06:06,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:06,304 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-16 11:06:06,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:06:06,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:06,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 896460838, now seen corresponding path program 1 times [2024-11-16 11:06:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788406669] [2024-11-16 11:06:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:07,686 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-16 11:06:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788406669] [2024-11-16 11:06:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788406669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 11:06:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181860391] [2024-11-16 11:06:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 11:06:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 11:06:07,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 11:06:07,691 INFO L87 Difference]: Start difference. First operand 475 states and 702 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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-16 11:06:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:08,335 INFO L93 Difference]: Finished difference Result 872 states and 1288 transitions. [2024-11-16 11:06:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 11:06:08,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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-16 11:06:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:08,338 INFO L225 Difference]: With dead ends: 872 [2024-11-16 11:06:08,338 INFO L226 Difference]: Without dead ends: 507 [2024-11-16 11:06:08,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-16 11:06:08,341 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 467 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:08,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 3009 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 11:06:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-16 11:06:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 499. [2024-11-16 11:06:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.4819277108433735) internal successors, (738), 498 states have internal predecessors, (738), 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-16 11:06:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 738 transitions. [2024-11-16 11:06:08,353 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 738 transitions. Word has length 105 [2024-11-16 11:06:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:08,353 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 738 transitions. [2024-11-16 11:06:08,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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-16 11:06:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 738 transitions. [2024-11-16 11:06:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 11:06:08,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:08,357 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-16 11:06:08,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:06:08,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1556733633, now seen corresponding path program 1 times [2024-11-16 11:06:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608318415] [2024-11-16 11:06:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:09,582 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-16 11:06:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:09,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608318415] [2024-11-16 11:06:09,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608318415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:09,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 11:06:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401759124] [2024-11-16 11:06:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 11:06:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 11:06:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 11:06:09,585 INFO L87 Difference]: Start difference. First operand 499 states and 738 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 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-16 11:06:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:10,295 INFO L93 Difference]: Finished difference Result 1215 states and 1792 transitions. [2024-11-16 11:06:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 11:06:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 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-16 11:06:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:10,299 INFO L225 Difference]: With dead ends: 1215 [2024-11-16 11:06:10,299 INFO L226 Difference]: Without dead ends: 838 [2024-11-16 11:06:10,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-16 11:06:10,301 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1023 mSDsluCounter, 3024 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 3405 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:10,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 3405 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:06:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-16 11:06:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 553. [2024-11-16 11:06:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4818840579710144) internal successors, (818), 552 states have internal predecessors, (818), 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-16 11:06:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 818 transitions. [2024-11-16 11:06:10,316 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 818 transitions. Word has length 106 [2024-11-16 11:06:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 818 transitions. [2024-11-16 11:06:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 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-16 11:06:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 818 transitions. [2024-11-16 11:06:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 11:06:10,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:10,318 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-16 11:06:10,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 11:06:10,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash -730099373, now seen corresponding path program 1 times [2024-11-16 11:06:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136449637] [2024-11-16 11:06:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:10,761 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-16 11:06:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:10,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136449637] [2024-11-16 11:06:10,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136449637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:10,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312546139] [2024-11-16 11:06:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:10,764 INFO L87 Difference]: Start difference. First operand 553 states and 818 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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-16 11:06:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:11,070 INFO L93 Difference]: Finished difference Result 979 states and 1447 transitions. [2024-11-16 11:06:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:11,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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-16 11:06:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:11,073 INFO L225 Difference]: With dead ends: 979 [2024-11-16 11:06:11,073 INFO L226 Difference]: Without dead ends: 553 [2024-11-16 11:06:11,074 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-16 11:06:11,075 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 440 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:11,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1006 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:06:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-16 11:06:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-16 11:06:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4782608695652173) internal successors, (816), 552 states have internal predecessors, (816), 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-16 11:06:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 816 transitions. [2024-11-16 11:06:11,086 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 816 transitions. Word has length 106 [2024-11-16 11:06:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:11,087 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 816 transitions. [2024-11-16 11:06:11,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 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-16 11:06:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 816 transitions. [2024-11-16 11:06:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 11:06:11,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:11,088 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-16 11:06:11,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 11:06:11,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -395560956, now seen corresponding path program 1 times [2024-11-16 11:06:11,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:11,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163720081] [2024-11-16 11:06:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:12,210 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-16 11:06:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163720081] [2024-11-16 11:06:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163720081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299422360] [2024-11-16 11:06:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:12,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:12,213 INFO L87 Difference]: Start difference. First operand 553 states and 816 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-16 11:06:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:12,592 INFO L93 Difference]: Finished difference Result 984 states and 1445 transitions. [2024-11-16 11:06:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:12,593 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-16 11:06:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:12,595 INFO L225 Difference]: With dead ends: 984 [2024-11-16 11:06:12,596 INFO L226 Difference]: Without dead ends: 604 [2024-11-16 11:06:12,596 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-16 11:06:12,597 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 903 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:12,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1138 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:06:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-16 11:06:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 553. [2024-11-16 11:06:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4764492753623188) internal successors, (815), 552 states have internal predecessors, (815), 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-16 11:06:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 815 transitions. [2024-11-16 11:06:12,608 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 815 transitions. Word has length 107 [2024-11-16 11:06:12,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:12,608 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 815 transitions. [2024-11-16 11:06:12,608 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-16 11:06:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 815 transitions. [2024-11-16 11:06:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 11:06:12,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:12,610 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-16 11:06:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 11:06:12,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1789712509, now seen corresponding path program 1 times [2024-11-16 11:06:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933530167] [2024-11-16 11:06:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:13,911 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-16 11:06:13,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:13,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933530167] [2024-11-16 11:06:13,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933530167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:13,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 11:06:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403890637] [2024-11-16 11:06:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:13,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 11:06:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 11:06:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:06:13,915 INFO L87 Difference]: Start difference. First operand 553 states and 815 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 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-16 11:06:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:14,552 INFO L93 Difference]: Finished difference Result 1015 states and 1491 transitions. [2024-11-16 11:06:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 11:06:14,553 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 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-16 11:06:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:14,555 INFO L225 Difference]: With dead ends: 1015 [2024-11-16 11:06:14,555 INFO L226 Difference]: Without dead ends: 629 [2024-11-16 11:06:14,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-16 11:06:14,557 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 481 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:14,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3125 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 11:06:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-16 11:06:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 615. [2024-11-16 11:06:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4690553745928339) internal successors, (902), 614 states have internal predecessors, (902), 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-16 11:06:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 902 transitions. [2024-11-16 11:06:14,570 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 902 transitions. Word has length 108 [2024-11-16 11:06:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:14,571 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 902 transitions. [2024-11-16 11:06:14,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 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-16 11:06:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 902 transitions. [2024-11-16 11:06:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 11:06:14,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:14,573 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-16 11:06:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 11:06:14,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1472791260, now seen corresponding path program 1 times [2024-11-16 11:06:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879944549] [2024-11-16 11:06:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:14,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:14,981 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-16 11:06:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:14,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879944549] [2024-11-16 11:06:14,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879944549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:14,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413884480] [2024-11-16 11:06:14,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:14,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:14,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:14,984 INFO L87 Difference]: Start difference. First operand 615 states and 902 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-16 11:06:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:15,161 INFO L93 Difference]: Finished difference Result 1046 states and 1535 transitions. [2024-11-16 11:06:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:15,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-16 11:06:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:15,163 INFO L225 Difference]: With dead ends: 1046 [2024-11-16 11:06:15,164 INFO L226 Difference]: Without dead ends: 587 [2024-11-16 11:06:15,164 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-16 11:06:15,165 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:15,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1193 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-16 11:06:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2024-11-16 11:06:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.4675767918088738) internal successors, (860), 586 states have internal predecessors, (860), 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-16 11:06:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 860 transitions. [2024-11-16 11:06:15,175 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 860 transitions. Word has length 108 [2024-11-16 11:06:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:15,175 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 860 transitions. [2024-11-16 11:06:15,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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-16 11:06:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 860 transitions. [2024-11-16 11:06:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 11:06:15,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:15,177 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-16 11:06:15,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 11:06:15,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash -663596122, now seen corresponding path program 1 times [2024-11-16 11:06:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623577441] [2024-11-16 11:06:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:16,073 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-16 11:06:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623577441] [2024-11-16 11:06:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623577441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:16,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 11:06:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111944330] [2024-11-16 11:06:16,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:16,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 11:06:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 11:06:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-16 11:06:16,075 INFO L87 Difference]: Start difference. First operand 587 states and 860 transitions. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 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-16 11:06:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:17,092 INFO L93 Difference]: Finished difference Result 1213 states and 1773 transitions. [2024-11-16 11:06:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 11:06:17,092 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 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-16 11:06:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:17,095 INFO L225 Difference]: With dead ends: 1213 [2024-11-16 11:06:17,095 INFO L226 Difference]: Without dead ends: 679 [2024-11-16 11:06:17,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2024-11-16 11:06:17,097 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1140 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:17,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 3891 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 11:06:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-16 11:06:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 614. [2024-11-16 11:06:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 1.464926590538336) internal successors, (898), 613 states have internal predecessors, (898), 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-16 11:06:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 898 transitions. [2024-11-16 11:06:17,107 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 898 transitions. Word has length 108 [2024-11-16 11:06:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:17,108 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 898 transitions. [2024-11-16 11:06:17,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 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-16 11:06:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 898 transitions. [2024-11-16 11:06:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:17,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:17,109 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-16 11:06:17,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 11:06:17,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:17,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1951643087, now seen corresponding path program 1 times [2024-11-16 11:06:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058384671] [2024-11-16 11:06:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:17,498 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-16 11:06:17,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058384671] [2024-11-16 11:06:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058384671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:17,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:06:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852744045] [2024-11-16 11:06:17,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:17,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:06:17,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:17,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:06:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:06:17,500 INFO L87 Difference]: Start difference. First operand 614 states and 898 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-16 11:06:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:17,766 INFO L93 Difference]: Finished difference Result 1172 states and 1714 transitions. [2024-11-16 11:06:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:06:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-16 11:06:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:17,768 INFO L225 Difference]: With dead ends: 1172 [2024-11-16 11:06:17,768 INFO L226 Difference]: Without dead ends: 617 [2024-11-16 11:06:17,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:06:17,771 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 455 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:17,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1476 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-16 11:06:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-11-16 11:06:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.4577922077922079) internal successors, (898), 616 states have internal predecessors, (898), 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-16 11:06:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 898 transitions. [2024-11-16 11:06:17,782 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 898 transitions. Word has length 109 [2024-11-16 11:06:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:17,782 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 898 transitions. [2024-11-16 11:06:17,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-16 11:06:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 898 transitions. [2024-11-16 11:06:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:17,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:17,784 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-16 11:06:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 11:06:17,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:17,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1703376794, now seen corresponding path program 1 times [2024-11-16 11:06:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125961767] [2024-11-16 11:06:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:18,204 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-16 11:06:18,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125961767] [2024-11-16 11:06:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125961767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:18,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:06:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722830971] [2024-11-16 11:06:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:18,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:06:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:06:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:06:18,206 INFO L87 Difference]: Start difference. First operand 617 states and 898 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-16 11:06:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:18,490 INFO L93 Difference]: Finished difference Result 1300 states and 1891 transitions. [2024-11-16 11:06:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:06:18,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-16 11:06:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:18,493 INFO L225 Difference]: With dead ends: 1300 [2024-11-16 11:06:18,493 INFO L226 Difference]: Without dead ends: 892 [2024-11-16 11:06:18,494 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-16 11:06:18,495 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 949 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:18,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1549 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 11:06:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-16 11:06:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 675. [2024-11-16 11:06:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.456973293768546) internal successors, (982), 674 states have internal predecessors, (982), 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-16 11:06:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 982 transitions. [2024-11-16 11:06:18,507 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 982 transitions. Word has length 109 [2024-11-16 11:06:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:18,507 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 982 transitions. [2024-11-16 11:06:18,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 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-16 11:06:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 982 transitions. [2024-11-16 11:06:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:18,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:18,509 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-16 11:06:18,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 11:06:18,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:18,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1418683402, now seen corresponding path program 1 times [2024-11-16 11:06:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908833215] [2024-11-16 11:06:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:18,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:19,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-16 11:06:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908833215] [2024-11-16 11:06:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908833215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521131594] [2024-11-16 11:06:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:19,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:19,126 INFO L87 Difference]: Start difference. First operand 675 states and 982 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:19,270 INFO L93 Difference]: Finished difference Result 1101 states and 1605 transitions. [2024-11-16 11:06:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:19,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:19,273 INFO L225 Difference]: With dead ends: 1101 [2024-11-16 11:06:19,273 INFO L226 Difference]: Without dead ends: 673 [2024-11-16 11:06:19,274 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-16 11:06:19,274 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 0 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:19,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 793 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-16 11:06:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2024-11-16 11:06:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4523809523809523) internal successors, (976), 672 states have internal predecessors, (976), 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-16 11:06:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 976 transitions. [2024-11-16 11:06:19,288 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 976 transitions. Word has length 109 [2024-11-16 11:06:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:19,288 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 976 transitions. [2024-11-16 11:06:19,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 976 transitions. [2024-11-16 11:06:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:19,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:19,289 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-16 11:06:19,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 11:06:19,290 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 909606719, now seen corresponding path program 1 times [2024-11-16 11:06:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718949616] [2024-11-16 11:06:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:19,805 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-16 11:06:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718949616] [2024-11-16 11:06:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718949616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:19,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:19,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854676507] [2024-11-16 11:06:19,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:19,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:19,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:19,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:19,809 INFO L87 Difference]: Start difference. First operand 673 states and 976 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-16 11:06:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:20,021 INFO L93 Difference]: Finished difference Result 1095 states and 1591 transitions. [2024-11-16 11:06:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:20,022 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-16 11:06:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:20,024 INFO L225 Difference]: With dead ends: 1095 [2024-11-16 11:06:20,024 INFO L226 Difference]: Without dead ends: 673 [2024-11-16 11:06:20,025 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-16 11:06:20,028 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:20,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1566 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-16 11:06:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2024-11-16 11:06:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.4494047619047619) internal successors, (974), 672 states have internal predecessors, (974), 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-16 11:06:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 974 transitions. [2024-11-16 11:06:20,041 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 974 transitions. Word has length 109 [2024-11-16 11:06:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:20,041 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 974 transitions. [2024-11-16 11:06:20,041 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-16 11:06:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 974 transitions. [2024-11-16 11:06:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:20,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:20,043 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-16 11:06:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 11:06:20,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 215515791, now seen corresponding path program 1 times [2024-11-16 11:06:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630498960] [2024-11-16 11:06:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:20,316 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-16 11:06:20,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:20,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630498960] [2024-11-16 11:06:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630498960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:20,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584892847] [2024-11-16 11:06:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:20,319 INFO L87 Difference]: Start difference. First operand 673 states and 974 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:20,481 INFO L93 Difference]: Finished difference Result 1229 states and 1779 transitions. [2024-11-16 11:06:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:20,484 INFO L225 Difference]: With dead ends: 1229 [2024-11-16 11:06:20,484 INFO L226 Difference]: Without dead ends: 668 [2024-11-16 11:06:20,485 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-16 11:06:20,486 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 431 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:20,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 767 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-16 11:06:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2024-11-16 11:06:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.4452773613193404) internal successors, (964), 667 states have internal predecessors, (964), 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-16 11:06:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 964 transitions. [2024-11-16 11:06:20,499 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 964 transitions. Word has length 109 [2024-11-16 11:06:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:20,499 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 964 transitions. [2024-11-16 11:06:20,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 964 transitions. [2024-11-16 11:06:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:20,501 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-16 11:06:20,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 11:06:20,501 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:20,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash -286164982, now seen corresponding path program 1 times [2024-11-16 11:06:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:20,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208055920] [2024-11-16 11:06:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:20,941 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-16 11:06:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208055920] [2024-11-16 11:06:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208055920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:20,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:06:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896576165] [2024-11-16 11:06:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:20,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:06:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:06:20,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:06:20,943 INFO L87 Difference]: Start difference. First operand 668 states and 964 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 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-16 11:06:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:21,219 INFO L93 Difference]: Finished difference Result 1253 states and 1809 transitions. [2024-11-16 11:06:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:06:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 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-16 11:06:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:21,222 INFO L225 Difference]: With dead ends: 1253 [2024-11-16 11:06:21,222 INFO L226 Difference]: Without dead ends: 683 [2024-11-16 11:06:21,224 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-16 11:06:21,225 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 441 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:21,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1871 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-16 11:06:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-11-16 11:06:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.4398826979472141) internal successors, (982), 682 states have internal predecessors, (982), 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-16 11:06:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 982 transitions. [2024-11-16 11:06:21,239 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 982 transitions. Word has length 109 [2024-11-16 11:06:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:21,239 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 982 transitions. [2024-11-16 11:06:21,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 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-16 11:06:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 982 transitions. [2024-11-16 11:06:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:21,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:21,241 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-16 11:06:21,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 11:06:21,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:21,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -23088522, now seen corresponding path program 1 times [2024-11-16 11:06:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51298918] [2024-11-16 11:06:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:21,450 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-16 11:06:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51298918] [2024-11-16 11:06:21,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51298918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:21,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:21,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:21,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276856618] [2024-11-16 11:06:21,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:21,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:21,454 INFO L87 Difference]: Start difference. First operand 683 states and 982 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:21,581 INFO L93 Difference]: Finished difference Result 1265 states and 1821 transitions. [2024-11-16 11:06:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:21,584 INFO L225 Difference]: With dead ends: 1265 [2024-11-16 11:06:21,585 INFO L226 Difference]: Without dead ends: 678 [2024-11-16 11:06:21,585 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-16 11:06:21,586 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 437 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:21,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 761 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-16 11:06:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2024-11-16 11:06:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.4357459379615953) internal successors, (972), 677 states have internal predecessors, (972), 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-16 11:06:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 972 transitions. [2024-11-16 11:06:21,596 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 972 transitions. Word has length 109 [2024-11-16 11:06:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:21,596 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 972 transitions. [2024-11-16 11:06:21,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 972 transitions. [2024-11-16 11:06:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 11:06:21,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:21,598 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-16 11:06:21,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 11:06:21,598 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1993989785, now seen corresponding path program 1 times [2024-11-16 11:06:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195264319] [2024-11-16 11:06:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:21,792 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-16 11:06:21,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195264319] [2024-11-16 11:06:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195264319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390527059] [2024-11-16 11:06:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:21,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:21,795 INFO L87 Difference]: Start difference. First operand 678 states and 972 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:21,944 INFO L93 Difference]: Finished difference Result 1262 states and 1812 transitions. [2024-11-16 11:06:21,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:21,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:21,947 INFO L225 Difference]: With dead ends: 1262 [2024-11-16 11:06:21,947 INFO L226 Difference]: Without dead ends: 668 [2024-11-16 11:06:21,948 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-16 11:06:21,948 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 439 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:21,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 755 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-16 11:06:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2024-11-16 11:06:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.434782608695652) internal successors, (957), 667 states have internal predecessors, (957), 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-16 11:06:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 957 transitions. [2024-11-16 11:06:21,958 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 957 transitions. Word has length 109 [2024-11-16 11:06:21,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:21,958 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 957 transitions. [2024-11-16 11:06:21,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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-16 11:06:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 957 transitions. [2024-11-16 11:06:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 11:06:21,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:21,960 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-16 11:06:21,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 11:06:21,960 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -556419893, now seen corresponding path program 1 times [2024-11-16 11:06:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520035731] [2024-11-16 11:06:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:22,217 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-16 11:06:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520035731] [2024-11-16 11:06:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520035731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:22,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583192993] [2024-11-16 11:06:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:22,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:22,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:22,219 INFO L87 Difference]: Start difference. First operand 668 states and 957 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-16 11:06:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:22,434 INFO L93 Difference]: Finished difference Result 1328 states and 1904 transitions. [2024-11-16 11:06:22,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:22,434 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-16 11:06:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:22,437 INFO L225 Difference]: With dead ends: 1328 [2024-11-16 11:06:22,437 INFO L226 Difference]: Without dead ends: 753 [2024-11-16 11:06:22,438 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-16 11:06:22,439 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1043 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:22,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1124 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-16 11:06:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 662. [2024-11-16 11:06:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4296520423600605) internal successors, (945), 661 states have internal predecessors, (945), 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-16 11:06:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 945 transitions. [2024-11-16 11:06:22,456 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 945 transitions. Word has length 110 [2024-11-16 11:06:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:22,456 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 945 transitions. [2024-11-16 11:06:22,457 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-16 11:06:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 945 transitions. [2024-11-16 11:06:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 11:06:22,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:22,458 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-16 11:06:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 11:06:22,458 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1829318116, now seen corresponding path program 1 times [2024-11-16 11:06:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093025461] [2024-11-16 11:06:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:23,524 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-16 11:06:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093025461] [2024-11-16 11:06:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093025461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:06:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817491675] [2024-11-16 11:06:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:23,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:06:23,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:06:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:06:23,526 INFO L87 Difference]: Start difference. First operand 662 states and 945 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 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-16 11:06:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:24,249 INFO L93 Difference]: Finished difference Result 1297 states and 1848 transitions. [2024-11-16 11:06:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 11:06:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 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-16 11:06:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:24,253 INFO L225 Difference]: With dead ends: 1297 [2024-11-16 11:06:24,253 INFO L226 Difference]: Without dead ends: 857 [2024-11-16 11:06:24,254 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-16 11:06:24,254 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 1187 mSDsluCounter, 2480 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:24,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 2957 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:06:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-16 11:06:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 664. [2024-11-16 11:06:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4268476621417798) internal successors, (946), 663 states have internal predecessors, (946), 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-16 11:06:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 946 transitions. [2024-11-16 11:06:24,265 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 946 transitions. Word has length 110 [2024-11-16 11:06:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 946 transitions. [2024-11-16 11:06:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 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-16 11:06:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 946 transitions. [2024-11-16 11:06:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 11:06:24,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:24,267 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-16 11:06:24,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 11:06:24,267 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:24,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1894904880, now seen corresponding path program 1 times [2024-11-16 11:06:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195557847] [2024-11-16 11:06:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:24,632 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-16 11:06:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195557847] [2024-11-16 11:06:24,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195557847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:06:24,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548887178] [2024-11-16 11:06:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:24,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:06:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:24,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:06:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:06:24,636 INFO L87 Difference]: Start difference. First operand 664 states and 946 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-16 11:06:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:25,147 INFO L93 Difference]: Finished difference Result 1350 states and 1924 transitions. [2024-11-16 11:06:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:06:25,147 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-16 11:06:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:25,150 INFO L225 Difference]: With dead ends: 1350 [2024-11-16 11:06:25,150 INFO L226 Difference]: Without dead ends: 757 [2024-11-16 11:06:25,151 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-16 11:06:25,151 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1048 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:25,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1582 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 11:06:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-16 11:06:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 666. [2024-11-16 11:06:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 1.4225563909774437) internal successors, (946), 665 states have internal predecessors, (946), 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-16 11:06:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 946 transitions. [2024-11-16 11:06:25,163 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 946 transitions. Word has length 110 [2024-11-16 11:06:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:25,163 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 946 transitions. [2024-11-16 11:06:25,163 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-16 11:06:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 946 transitions. [2024-11-16 11:06:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 11:06:25,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:25,164 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-16 11:06:25,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 11:06:25,165 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:25,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1277046635, now seen corresponding path program 1 times [2024-11-16 11:06:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994870295] [2024-11-16 11:06:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:25,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:25,420 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-16 11:06:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:25,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994870295] [2024-11-16 11:06:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994870295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:25,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:25,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463641403] [2024-11-16 11:06:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:25,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:25,423 INFO L87 Difference]: Start difference. First operand 666 states and 946 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-16 11:06:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:25,687 INFO L93 Difference]: Finished difference Result 1323 states and 1881 transitions. [2024-11-16 11:06:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:25,688 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-16 11:06:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:25,689 INFO L225 Difference]: With dead ends: 1323 [2024-11-16 11:06:25,689 INFO L226 Difference]: Without dead ends: 713 [2024-11-16 11:06:25,690 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-16 11:06:25,690 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 977 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:25,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1115 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-16 11:06:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2024-11-16 11:06:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4274570982839314) internal successors, (915), 641 states have internal predecessors, (915), 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-16 11:06:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 915 transitions. [2024-11-16 11:06:25,700 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 915 transitions. Word has length 110 [2024-11-16 11:06:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:25,701 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 915 transitions. [2024-11-16 11:06:25,701 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-16 11:06:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 915 transitions. [2024-11-16 11:06:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 11:06:25,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:25,702 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-16 11:06:25,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 11:06:25,702 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash 875972421, now seen corresponding path program 1 times [2024-11-16 11:06:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47671396] [2024-11-16 11:06:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:25,893 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-16 11:06:25,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:25,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47671396] [2024-11-16 11:06:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47671396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:25,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800958310] [2024-11-16 11:06:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:25,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:25,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:25,896 INFO L87 Difference]: Start difference. First operand 642 states and 915 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-16 11:06:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:26,012 INFO L93 Difference]: Finished difference Result 1123 states and 1599 transitions. [2024-11-16 11:06:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:26,013 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-16 11:06:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:26,014 INFO L225 Difference]: With dead ends: 1123 [2024-11-16 11:06:26,014 INFO L226 Difference]: Without dead ends: 543 [2024-11-16 11:06:26,015 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-16 11:06:26,015 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 427 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:26,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 749 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-16 11:06:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2024-11-16 11:06:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.418819188191882) internal successors, (769), 542 states have internal predecessors, (769), 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-16 11:06:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 769 transitions. [2024-11-16 11:06:26,028 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 769 transitions. Word has length 111 [2024-11-16 11:06:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:26,028 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 769 transitions. [2024-11-16 11:06:26,028 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-16 11:06:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 769 transitions. [2024-11-16 11:06:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 11:06:26,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:26,029 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-16 11:06:26,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 11:06:26,029 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:26,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1478622351, now seen corresponding path program 1 times [2024-11-16 11:06:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:26,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113372397] [2024-11-16 11:06:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:26,372 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-16 11:06:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113372397] [2024-11-16 11:06:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113372397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:26,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896075153] [2024-11-16 11:06:26,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:26,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:26,376 INFO L87 Difference]: Start difference. First operand 543 states and 769 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-16 11:06:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:26,536 INFO L93 Difference]: Finished difference Result 991 states and 1411 transitions. [2024-11-16 11:06:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:26,537 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-16 11:06:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:26,539 INFO L225 Difference]: With dead ends: 991 [2024-11-16 11:06:26,539 INFO L226 Difference]: Without dead ends: 557 [2024-11-16 11:06:26,540 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-16 11:06:26,540 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 3 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:26,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1516 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-16 11:06:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2024-11-16 11:06:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.411231884057971) internal successors, (779), 552 states have internal predecessors, (779), 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-16 11:06:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 779 transitions. [2024-11-16 11:06:26,548 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 779 transitions. Word has length 111 [2024-11-16 11:06:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:26,549 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 779 transitions. [2024-11-16 11:06:26,549 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-16 11:06:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 779 transitions. [2024-11-16 11:06:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 11:06:26,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:26,550 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-16 11:06:26,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 11:06:26,550 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:26,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:26,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2132743651, now seen corresponding path program 1 times [2024-11-16 11:06:26,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:26,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967646969] [2024-11-16 11:06:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:27,579 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-16 11:06:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967646969] [2024-11-16 11:06:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967646969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:27,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108844272] [2024-11-16 11:06:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:27,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:27,582 INFO L87 Difference]: Start difference. First operand 553 states and 779 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 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-16 11:06:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:27,830 INFO L93 Difference]: Finished difference Result 1024 states and 1450 transitions. [2024-11-16 11:06:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:27,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 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-16 11:06:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:27,832 INFO L225 Difference]: With dead ends: 1024 [2024-11-16 11:06:27,832 INFO L226 Difference]: Without dead ends: 604 [2024-11-16 11:06:27,833 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-16 11:06:27,833 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 743 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:27,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1095 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-16 11:06:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 553. [2024-11-16 11:06:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.4094202898550725) internal successors, (778), 552 states have internal predecessors, (778), 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-16 11:06:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 778 transitions. [2024-11-16 11:06:27,844 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 778 transitions. Word has length 112 [2024-11-16 11:06:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:27,845 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 778 transitions. [2024-11-16 11:06:27,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 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-16 11:06:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 778 transitions. [2024-11-16 11:06:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 11:06:27,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:27,846 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-16 11:06:27,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 11:06:27,846 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -708788517, now seen corresponding path program 1 times [2024-11-16 11:06:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267744585] [2024-11-16 11:06:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:28,690 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-16 11:06:28,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:28,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267744585] [2024-11-16 11:06:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267744585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:28,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 11:06:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124135249] [2024-11-16 11:06:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:06:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:28,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:06:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:06:28,693 INFO L87 Difference]: Start difference. First operand 553 states and 778 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 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-16 11:06:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:29,101 INFO L93 Difference]: Finished difference Result 1084 states and 1539 transitions. [2024-11-16 11:06:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:06:29,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 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-16 11:06:29,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:29,104 INFO L225 Difference]: With dead ends: 1084 [2024-11-16 11:06:29,104 INFO L226 Difference]: Without dead ends: 672 [2024-11-16 11:06:29,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:06:29,106 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 938 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:29,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 2245 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:06:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-16 11:06:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 555. [2024-11-16 11:06:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.407942238267148) internal successors, (780), 554 states have internal predecessors, (780), 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-16 11:06:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 780 transitions. [2024-11-16 11:06:29,115 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 780 transitions. Word has length 113 [2024-11-16 11:06:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:29,115 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 780 transitions. [2024-11-16 11:06:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 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-16 11:06:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 780 transitions. [2024-11-16 11:06:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 11:06:29,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:29,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:06:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 11:06:29,117 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash -482355050, now seen corresponding path program 1 times [2024-11-16 11:06:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114922970] [2024-11-16 11:06:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:29,909 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-16 11:06:29,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:29,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114922970] [2024-11-16 11:06:29,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114922970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:29,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:29,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 11:06:29,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657771506] [2024-11-16 11:06:29,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:29,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 11:06:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:29,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 11:06:29,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 11:06:29,911 INFO L87 Difference]: Start difference. First operand 555 states and 780 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-16 11:06:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:30,712 INFO L93 Difference]: Finished difference Result 1119 states and 1592 transitions. [2024-11-16 11:06:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:06:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-16 11:06:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:30,714 INFO L225 Difference]: With dead ends: 1119 [2024-11-16 11:06:30,714 INFO L226 Difference]: Without dead ends: 710 [2024-11-16 11:06:30,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-16 11:06:30,715 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1125 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 2462 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:30,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 2462 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 11:06:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-16 11:06:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 555. [2024-11-16 11:06:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4061371841155235) internal successors, (779), 554 states have internal predecessors, (779), 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-16 11:06:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 779 transitions. [2024-11-16 11:06:30,724 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 779 transitions. Word has length 113 [2024-11-16 11:06:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:30,725 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 779 transitions. [2024-11-16 11:06:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-16 11:06:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 779 transitions. [2024-11-16 11:06:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 11:06:30,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:30,726 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-16 11:06:30,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 11:06:30,726 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2096613000, now seen corresponding path program 1 times [2024-11-16 11:06:30,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:30,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208408182] [2024-11-16 11:06:30,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:30,964 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-16 11:06:30,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:30,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208408182] [2024-11-16 11:06:30,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208408182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:30,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:30,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347606635] [2024-11-16 11:06:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:30,967 INFO L87 Difference]: Start difference. First operand 555 states and 779 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-16 11:06:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:31,169 INFO L93 Difference]: Finished difference Result 972 states and 1376 transitions. [2024-11-16 11:06:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:31,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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 114 [2024-11-16 11:06:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:31,171 INFO L225 Difference]: With dead ends: 972 [2024-11-16 11:06:31,171 INFO L226 Difference]: Without dead ends: 563 [2024-11-16 11:06:31,172 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-16 11:06:31,172 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 2 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:31,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1517 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:06:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-16 11:06:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2024-11-16 11:06:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4035714285714285) internal successors, (786), 560 states have internal predecessors, (786), 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-16 11:06:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 786 transitions. [2024-11-16 11:06:31,180 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 786 transitions. Word has length 114 [2024-11-16 11:06:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:31,180 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 786 transitions. [2024-11-16 11:06:31,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-16 11:06:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 786 transitions. [2024-11-16 11:06:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 11:06:31,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:31,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 11:06:31,181 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:31,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 194601445, now seen corresponding path program 1 times [2024-11-16 11:06:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:31,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653129800] [2024-11-16 11:06:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:31,700 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-16 11:06:31,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653129800] [2024-11-16 11:06:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653129800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136538416] [2024-11-16 11:06:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:31,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:31,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:31,702 INFO L87 Difference]: Start difference. First operand 561 states and 786 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-16 11:06:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:31,836 INFO L93 Difference]: Finished difference Result 981 states and 1386 transitions. [2024-11-16 11:06:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2024-11-16 11:06:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:31,838 INFO L225 Difference]: With dead ends: 981 [2024-11-16 11:06:31,838 INFO L226 Difference]: Without dead ends: 554 [2024-11-16 11:06:31,839 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-16 11:06:31,839 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:31,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1143 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-16 11:06:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2024-11-16 11:06:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.403254972875226) internal successors, (776), 553 states have internal predecessors, (776), 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-16 11:06:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions. [2024-11-16 11:06:31,847 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 114 [2024-11-16 11:06:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:31,848 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 776 transitions. [2024-11-16 11:06:31,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-16 11:06:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions. [2024-11-16 11:06:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 11:06:31,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:31,849 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, 1] [2024-11-16 11:06:31,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 11:06:31,849 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:31,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash 954825265, now seen corresponding path program 1 times [2024-11-16 11:06:31,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:31,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818707761] [2024-11-16 11:06:31,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:31,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:06:31,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:06:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:06:32,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:06:32,235 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:06:32,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:06:32,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 11:06:32,241 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-16 11:06:32,351 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:06:32,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:06:32 BoogieIcfgContainer [2024-11-16 11:06:32,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:06:32,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:06:32,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:06:32,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:06:32,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:05:58" (3/4) ... [2024-11-16 11:06:32,360 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:06:32,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:06:32,362 INFO L158 Benchmark]: Toolchain (without parser) took 37235.13ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 99.4MB in the beginning and 1.1GB in the end (delta: -987.7MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-11-16 11:06:32,362 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:06:32,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 852.20ms. Allocated memory is still 172.0MB. Free memory was 99.4MB in the beginning and 122.7MB in the end (delta: -23.3MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2024-11-16 11:06:32,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 230.99ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 81.5MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-16 11:06:32,364 INFO L158 Benchmark]: Boogie Preprocessor took 337.93ms. Allocated memory is still 172.0MB. Free memory was 81.5MB in the beginning and 112.3MB in the end (delta: -30.8MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-11-16 11:06:32,364 INFO L158 Benchmark]: IcfgBuilder took 2428.95ms. Allocated memory was 172.0MB in the beginning and 325.1MB in the end (delta: 153.1MB). Free memory was 112.3MB in the beginning and 229.2MB in the end (delta: -116.8MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. [2024-11-16 11:06:32,365 INFO L158 Benchmark]: TraceAbstraction took 33372.76ms. Allocated memory was 325.1MB in the beginning and 1.2GB in the end (delta: 882.9MB). Free memory was 228.1MB in the beginning and 1.1GB in the end (delta: -859.0MB). Peak memory consumption was 699.2MB. Max. memory is 16.1GB. [2024-11-16 11:06:32,365 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:06:32,366 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 852.20ms. Allocated memory is still 172.0MB. Free memory was 99.4MB in the beginning and 122.7MB in the end (delta: -23.3MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 230.99ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 81.5MB in the end (delta: 41.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 337.93ms. Allocated memory is still 172.0MB. Free memory was 81.5MB in the beginning and 112.3MB in the end (delta: -30.8MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * IcfgBuilder took 2428.95ms. Allocated memory was 172.0MB in the beginning and 325.1MB in the end (delta: 153.1MB). Free memory was 112.3MB in the beginning and 229.2MB in the end (delta: -116.8MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33372.76ms. Allocated memory was 325.1MB in the beginning and 1.2GB in the end (delta: 882.9MB). Free memory was 228.1MB in the beginning and 1.1GB in the end (delta: -859.0MB). Peak memory consumption was 699.2MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 1.2GB. Free memory is still 1.1GB. 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, 329 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18048 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18048 mSDsluCounter, 50757 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38961 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13833 IncrementalHoareTripleChecker+Invalid, 13857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 11796 mSDtfsCounter, 13833 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=18, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 1750 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3327 ConstructedInterpolants, 0 QuantifiedInterpolants, 10317 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-16 11:06:32,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:06:34,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:06:34,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:06:34,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:06:34,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:06:34,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:06:34,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:06:34,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:06:34,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:06:34,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:06:34,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:06:34,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:06:34,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:06:34,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:06:34,772 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:06:34,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:06:34,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:06:34,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:06:34,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:06:34,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:06:34,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:06:34,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:06:34,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:06:34,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:06:34,778 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:06:34,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:06:34,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:06:34,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:06:34,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:06:34,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:06:34,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:06:34,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:06:34,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:06:34,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:06:34,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:06:34,781 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:06:34,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:06:34,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:06:34,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:06:34,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:06:34,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:06:34,782 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-16 11:06:35,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:06:35,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:06:35,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:06:35,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:06:35,140 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:06:35,142 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-16 11:06:36,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:06:37,061 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:06:37,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-16 11:06:37,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60d7a38f/de1d6b7440634cf8858185711dd619d5/FLAGb0057e651 [2024-11-16 11:06:37,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60d7a38f/de1d6b7440634cf8858185711dd619d5 [2024-11-16 11:06:37,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:06:37,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:06:37,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:06:37,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:06:37,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:06:37,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:37,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34109e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37, skipping insertion in model container [2024-11-16 11:06:37,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:37,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:06:37,411 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-16 11:06:37,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:06:37,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:06:37,691 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-16 11:06:37,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:06:37,841 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:06:37,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37 WrapperNode [2024-11-16 11:06:37,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:06:37,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:06:37,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:06:37,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:06:37,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:37,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:37,984 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1585 [2024-11-16 11:06:37,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:06:37,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:06:37,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:06:37,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:06:37,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:37,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,052 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-16 11:06:38,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:06:38,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:06:38,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:06:38,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:06:38,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (1/1) ... [2024-11-16 11:06:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:06:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:06:38,214 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-16 11:06:38,222 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-16 11:06:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:06:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:06:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:06:38,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:06:38,560 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:06:38,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:06:39,662 INFO L? ?]: Removed 272 outVars from TransFormulas that were not future-live. [2024-11-16 11:06:39,662 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:06:39,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:06:39,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:06:39,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:39 BoogieIcfgContainer [2024-11-16 11:06:39,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:06:39,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:06:39,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:06:39,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:06:39,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:06:37" (1/3) ... [2024-11-16 11:06:39,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286e29e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:39, skipping insertion in model container [2024-11-16 11:06:39,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:37" (2/3) ... [2024-11-16 11:06:39,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286e29e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:39, skipping insertion in model container [2024-11-16 11:06:39,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:39" (3/3) ... [2024-11-16 11:06:39,683 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2024-11-16 11:06:39,698 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:06:39,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:06:39,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:06:39,763 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;@6dc91166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:06:39,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:06:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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-16 11:06:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:06:39,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:39,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:06:39,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:06:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:06:39,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141861903] [2024-11-16 11:06:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:39,795 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-16 11:06:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:06:39,799 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-16 11:06:39,801 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-16 11:06:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:40,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-16 11:06:40,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:06:41,552 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-16 11:06:41,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:06:41,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:06:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141861903] [2024-11-16 11:06:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141861903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128382322] [2024-11-16 11:06:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:06:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:41,589 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 11:06:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:41,733 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 11:06:41,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:41,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-16 11:06:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:41,743 INFO L225 Difference]: With dead ends: 22 [2024-11-16 11:06:41,744 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 11:06:41,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 11:06:41,749 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 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-16 11:06:41,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 11:06:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 11:06:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-16 11:06:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:06:41,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:06:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:41,810 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:06:41,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 11:06:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:06:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:06:41,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:41,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:41,819 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-16 11:06:42,012 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-16 11:06:42,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:06:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:06:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122581367] [2024-11-16 11:06:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:42,015 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-16 11:06:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:06:42,020 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-16 11:06:42,022 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-16 11:06:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:42,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 184 conjuncts are in the unsatisfiable core [2024-11-16 11:06:42,780 INFO L278 TraceCheckSpWp]: Computing forward predicates...