./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 04:59:55,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 04:59:56,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 04:59:56,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 04:59:56,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 04:59:56,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 04:59:56,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 04:59:56,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 04:59:56,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 04:59:56,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 04:59:56,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 04:59:56,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 04:59:56,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 04:59:56,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 04:59:56,087 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 04:59:56,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 04:59:56,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 04:59:56,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 04:59:56,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 04:59:56,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 04:59:56,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 04:59:56,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 04:59:56,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 04:59:56,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 04:59:56,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 04:59:56,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 04:59:56,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 04:59:56,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 04:59:56,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 04:59:56,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:59:56,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 04:59:56,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 04:59:56,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 04:59:56,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 04:59:56,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 04:59:56,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 04:59:56,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 04:59:56,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 04:59:56,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 04:59:56,095 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 -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2024-10-24 04:59:56,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 04:59:56,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 04:59:56,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 04:59:56,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 04:59:56,356 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 04:59:56,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-10-24 04:59:57,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 04:59:58,050 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 04:59:58,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-10-24 04:59:58,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78953f7/1c83b832ac2d46d8bdb3068897e84512/FLAG4d63c8199 [2024-10-24 04:59:58,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78953f7/1c83b832ac2d46d8bdb3068897e84512 [2024-10-24 04:59:58,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 04:59:58,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 04:59:58,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 04:59:58,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 04:59:58,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 04:59:58,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e5e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58, skipping insertion in model container [2024-10-24 04:59:58,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 04:59:58,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-10-24 04:59:58,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:59:58,490 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 04:59:58,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-10-24 04:59:58,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 04:59:58,600 INFO L204 MainTranslator]: Completed translation [2024-10-24 04:59:58,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58 WrapperNode [2024-10-24 04:59:58,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 04:59:58,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 04:59:58,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 04:59:58,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 04:59:58,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,730 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 932 [2024-10-24 04:59:58,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 04:59:58,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 04:59:58,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 04:59:58,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 04:59:58,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,812 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 04:59:58,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 04:59:58,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 04:59:58,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 04:59:58,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 04:59:58,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (1/1) ... [2024-10-24 04:59:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 04:59:58,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 04:59:58,932 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-10-24 04:59:58,936 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-10-24 04:59:58,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 04:59:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 04:59:58,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 04:59:58,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 04:59:59,146 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 04:59:59,148 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:00:00,256 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2024-10-24 05:00:00,257 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:00:00,287 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:00:00,287 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:00:00,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:00:00 BoogieIcfgContainer [2024-10-24 05:00:00,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:00:00,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:00:00,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:00:00,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:00:00,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:59:58" (1/3) ... [2024-10-24 05:00:00,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9cbf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:00:00, skipping insertion in model container [2024-10-24 05:00:00,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:59:58" (2/3) ... [2024-10-24 05:00:00,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9cbf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:00:00, skipping insertion in model container [2024-10-24 05:00:00,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:00:00" (3/3) ... [2024-10-24 05:00:00,296 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-10-24 05:00:00,311 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:00:00,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:00:00,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:00:00,395 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;@4fd90a6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:00:00,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:00:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 237 states have (on average 1.5021097046413503) internal successors, (356), 238 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 05:00:00,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:00,416 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-10-24 05:00:00,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:00,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1815109145, now seen corresponding path program 1 times [2024-10-24 05:00:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733385885] [2024-10-24 05:00:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733385885] [2024-10-24 05:00:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733385885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:01,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:00:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846194112] [2024-10-24 05:00:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:01,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:00:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:01,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:00:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:00:01,668 INFO L87 Difference]: Start difference. First operand has 239 states, 237 states have (on average 1.5021097046413503) internal successors, (356), 238 states have internal predecessors, (356), 0 states have call successors, (0), 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 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:01,745 INFO L93 Difference]: Finished difference Result 410 states and 612 transitions. [2024-10-24 05:00:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:00:01,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-10-24 05:00:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:01,759 INFO L225 Difference]: With dead ends: 410 [2024-10-24 05:00:01,759 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 05:00:01,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:00:01,766 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:01,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:00:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 05:00:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-24 05:00:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2024-10-24 05:00:01,810 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 110 [2024-10-24 05:00:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:01,811 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2024-10-24 05:00:01,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2024-10-24 05:00:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 05:00:01,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:01,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:00:01,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:00:01,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:01,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 435504489, now seen corresponding path program 1 times [2024-10-24 05:00:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:01,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507939740] [2024-10-24 05:00:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507939740] [2024-10-24 05:00:02,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507939740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:02,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:02,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:00:02,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883054714] [2024-10-24 05:00:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:02,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:00:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:02,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:00:02,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:00:02,277 INFO L87 Difference]: Start difference. First operand 240 states and 356 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-10-24 05:00:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:02,323 INFO L93 Difference]: Finished difference Result 413 states and 612 transitions. [2024-10-24 05:00:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:00:02,325 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-10-24 05:00:02,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:02,327 INFO L225 Difference]: With dead ends: 413 [2024-10-24 05:00:02,330 INFO L226 Difference]: Without dead ends: 242 [2024-10-24 05:00:02,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:00:02,332 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:02,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1045 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:00:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-24 05:00:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-10-24 05:00:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 241 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 358 transitions. [2024-10-24 05:00:02,350 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 358 transitions. Word has length 111 [2024-10-24 05:00:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:02,351 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 358 transitions. [2024-10-24 05:00:02,351 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-10-24 05:00:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 358 transitions. [2024-10-24 05:00:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 05:00:02,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:02,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, 1, 1, 1, 1, 1, 1] [2024-10-24 05:00:02,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:00:02,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:02,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -482227982, now seen corresponding path program 1 times [2024-10-24 05:00:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601738496] [2024-10-24 05:00:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601738496] [2024-10-24 05:00:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601738496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:03,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:00:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371350840] [2024-10-24 05:00:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:03,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:00:03,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:03,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:00:03,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:00:03,545 INFO L87 Difference]: Start difference. First operand 242 states and 358 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) 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-10-24 05:00:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:03,636 INFO L93 Difference]: Finished difference Result 435 states and 643 transitions. [2024-10-24 05:00:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:00:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) 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-10-24 05:00:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:03,639 INFO L225 Difference]: With dead ends: 435 [2024-10-24 05:00:03,640 INFO L226 Difference]: Without dead ends: 262 [2024-10-24 05:00:03,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:00:03,642 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 308 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:03,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1374 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:00:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-24 05:00:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-10-24 05:00:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.4826254826254825) internal successors, (384), 259 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2024-10-24 05:00:03,664 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 112 [2024-10-24 05:00:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:03,665 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2024-10-24 05:00:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) 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-10-24 05:00:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2024-10-24 05:00:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 05:00:03,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:03,667 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-10-24 05:00:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:00:03,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:03,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1155278064, now seen corresponding path program 1 times [2024-10-24 05:00:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800592401] [2024-10-24 05:00:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:04,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800592401] [2024-10-24 05:00:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800592401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:04,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:00:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775730373] [2024-10-24 05:00:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:00:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:00:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:00:04,931 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 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-10-24 05:00:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:05,139 INFO L93 Difference]: Finished difference Result 457 states and 674 transitions. [2024-10-24 05:00:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 05:00:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 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-10-24 05:00:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:05,142 INFO L225 Difference]: With dead ends: 457 [2024-10-24 05:00:05,142 INFO L226 Difference]: Without dead ends: 266 [2024-10-24 05:00:05,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:00:05,147 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 312 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:05,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1982 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:00:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-24 05:00:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-10-24 05:00:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.479087452471483) internal successors, (389), 263 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 389 transitions. [2024-10-24 05:00:05,155 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 389 transitions. Word has length 113 [2024-10-24 05:00:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:05,156 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 389 transitions. [2024-10-24 05:00:05,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 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-10-24 05:00:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 389 transitions. [2024-10-24 05:00:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 05:00:05,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:05,158 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-10-24 05:00:05,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:00:05,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:05,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash -819070093, now seen corresponding path program 1 times [2024-10-24 05:00:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919455205] [2024-10-24 05:00:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:06,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919455205] [2024-10-24 05:00:06,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919455205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:06,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:06,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:00:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650624660] [2024-10-24 05:00:06,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:06,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:00:06,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:06,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:00:06,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:00:06,356 INFO L87 Difference]: Start difference. First operand 264 states and 389 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:06,495 INFO L93 Difference]: Finished difference Result 479 states and 705 transitions. [2024-10-24 05:00:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:00:06,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-24 05:00:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:06,497 INFO L225 Difference]: With dead ends: 479 [2024-10-24 05:00:06,497 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 05:00:06,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:00:06,499 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 279 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:06,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1437 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:00:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 05:00:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2024-10-24 05:00:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4768683274021353) internal successors, (415), 281 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 415 transitions. [2024-10-24 05:00:06,514 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 415 transitions. Word has length 113 [2024-10-24 05:00:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:06,515 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 415 transitions. [2024-10-24 05:00:06,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2024-10-24 05:00:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 05:00:06,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:06,517 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-10-24 05:00:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:00:06,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 110664174, now seen corresponding path program 1 times [2024-10-24 05:00:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455072622] [2024-10-24 05:00:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:07,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455072622] [2024-10-24 05:00:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455072622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:07,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:07,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:00:07,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011480249] [2024-10-24 05:00:07,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:00:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:00:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:00:07,562 INFO L87 Difference]: Start difference. First operand 282 states and 415 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 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-10-24 05:00:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:08,002 INFO L93 Difference]: Finished difference Result 674 states and 990 transitions. [2024-10-24 05:00:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 05:00:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 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-10-24 05:00:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:08,005 INFO L225 Difference]: With dead ends: 674 [2024-10-24 05:00:08,005 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 05:00:08,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:00:08,008 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 506 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:08,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2504 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:00:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 05:00:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-24 05:00:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.469964664310954) internal successors, (416), 283 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 416 transitions. [2024-10-24 05:00:08,019 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 416 transitions. Word has length 114 [2024-10-24 05:00:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:08,020 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 416 transitions. [2024-10-24 05:00:08,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 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-10-24 05:00:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 416 transitions. [2024-10-24 05:00:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 05:00:08,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:08,025 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-10-24 05:00:08,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:00:08,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:08,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1287518383, now seen corresponding path program 1 times [2024-10-24 05:00:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:08,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382108068] [2024-10-24 05:00:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:09,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382108068] [2024-10-24 05:00:09,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382108068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:09,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:00:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398315057] [2024-10-24 05:00:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:09,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:00:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:00:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:00:09,263 INFO L87 Difference]: Start difference. First operand 284 states and 416 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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-10-24 05:00:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:09,384 INFO L93 Difference]: Finished difference Result 563 states and 824 transitions. [2024-10-24 05:00:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:00:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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-10-24 05:00:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:09,386 INFO L225 Difference]: With dead ends: 563 [2024-10-24 05:00:09,386 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 05:00:09,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:00:09,388 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 407 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:09,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 2079 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:00:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 05:00:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 322. [2024-10-24 05:00:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.470404984423676) internal successors, (472), 321 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 472 transitions. [2024-10-24 05:00:09,396 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 472 transitions. Word has length 114 [2024-10-24 05:00:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:09,396 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 472 transitions. [2024-10-24 05:00:09,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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-10-24 05:00:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 472 transitions. [2024-10-24 05:00:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 05:00:09,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:09,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:00:09,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:00:09,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:09,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1043974559, now seen corresponding path program 1 times [2024-10-24 05:00:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008038810] [2024-10-24 05:00:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:10,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:10,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008038810] [2024-10-24 05:00:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008038810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:10,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:10,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:00:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058181968] [2024-10-24 05:00:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:10,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:00:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:00:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:00:10,227 INFO L87 Difference]: Start difference. First operand 322 states and 472 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:10,310 INFO L93 Difference]: Finished difference Result 599 states and 874 transitions. [2024-10-24 05:00:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:00:10,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 05:00:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:10,312 INFO L225 Difference]: With dead ends: 599 [2024-10-24 05:00:10,312 INFO L226 Difference]: Without dead ends: 346 [2024-10-24 05:00:10,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:00:10,313 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 5 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:10,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1713 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:00:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-24 05:00:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 333. [2024-10-24 05:00:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.466867469879518) internal successors, (487), 332 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 487 transitions. [2024-10-24 05:00:10,324 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 487 transitions. Word has length 115 [2024-10-24 05:00:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:10,324 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 487 transitions. [2024-10-24 05:00:10,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 487 transitions. [2024-10-24 05:00:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 05:00:10,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:10,326 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-10-24 05:00:10,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 05:00:10,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:10,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2005793922, now seen corresponding path program 1 times [2024-10-24 05:00:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265134098] [2024-10-24 05:00:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:00:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 05:00:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:00:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265134098] [2024-10-24 05:00:11,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265134098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:00:11,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:00:11,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:00:11,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396807034] [2024-10-24 05:00:11,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:00:11,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:00:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:00:11,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:00:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:00:11,225 INFO L87 Difference]: Start difference. First operand 333 states and 487 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:00:11,337 INFO L93 Difference]: Finished difference Result 597 states and 871 transitions. [2024-10-24 05:00:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:00:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 05:00:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:00:11,343 INFO L225 Difference]: With dead ends: 597 [2024-10-24 05:00:11,343 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 05:00:11,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:00:11,344 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 261 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:00:11,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1628 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:00:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 05:00:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2024-10-24 05:00:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.4652567975830815) internal successors, (485), 331 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 485 transitions. [2024-10-24 05:00:11,354 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 485 transitions. Word has length 115 [2024-10-24 05:00:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:00:11,355 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 485 transitions. [2024-10-24 05:00:11,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 485 transitions. [2024-10-24 05:00:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 05:00:11,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:00:11,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 05:00:11,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -680352068, now seen corresponding path program 1 times [2024-10-24 05:00:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:00:11,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111199516] [2024-10-24 05:00:11,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:00:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:00:11,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:00:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:00:11,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:00:11,855 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:00:11,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:00:11,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 05:00:11,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:00:11,973 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:00:11,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:00:11 BoogieIcfgContainer [2024-10-24 05:00:11,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:00:11,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:00:11,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:00:11,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:00:11,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:00:00" (3/4) ... [2024-10-24 05:00:11,979 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:00:11,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:00:11,981 INFO L158 Benchmark]: Toolchain (without parser) took 13899.65ms. Allocated memory was 161.5MB in the beginning and 564.1MB in the end (delta: 402.7MB). Free memory was 97.3MB in the beginning and 292.0MB in the end (delta: -194.7MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. [2024-10-24 05:00:11,981 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:00:11,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.08ms. Allocated memory is still 161.5MB. Free memory was 96.9MB in the beginning and 120.0MB in the end (delta: -23.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-24 05:00:11,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.44ms. Allocated memory is still 161.5MB. Free memory was 120.0MB in the beginning and 100.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 05:00:11,982 INFO L158 Benchmark]: Boogie Preprocessor took 164.85ms. Allocated memory is still 161.5MB. Free memory was 100.6MB in the beginning and 89.3MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 05:00:11,983 INFO L158 Benchmark]: RCFGBuilder took 1390.27ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 89.3MB in the beginning and 111.9MB in the end (delta: -22.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 05:00:11,983 INFO L158 Benchmark]: TraceAbstraction took 11686.48ms. Allocated memory was 195.0MB in the beginning and 564.1MB in the end (delta: 369.1MB). Free memory was 110.9MB in the beginning and 292.0MB in the end (delta: -181.1MB). Peak memory consumption was 188.0MB. Max. memory is 16.1GB. [2024-10-24 05:00:11,983 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 564.1MB. Free memory is still 292.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:00:11,985 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 96.5MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.08ms. Allocated memory is still 161.5MB. Free memory was 96.9MB in the beginning and 120.0MB in the end (delta: -23.2MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.44ms. Allocated memory is still 161.5MB. Free memory was 120.0MB in the beginning and 100.6MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.85ms. Allocated memory is still 161.5MB. Free memory was 100.6MB in the beginning and 89.3MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1390.27ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 89.3MB in the beginning and 111.9MB in the end (delta: -22.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11686.48ms. Allocated memory was 195.0MB in the beginning and 564.1MB in the end (delta: 369.1MB). Free memory was 110.9MB in the beginning and 292.0MB in the end (delta: -181.1MB). Peak memory consumption was 188.0MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 564.1MB. Free memory is still 292.0MB. 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 325, overapproximation of bitwiseAnd at line 332. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] EXPR var_27 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_71_arg_0=0, var_71_arg_1=1, var_89=0] [L179] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_75_arg_0=0, var_75_arg_1=1, var_89=0] [L185] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_79_arg_0=0, var_79_arg_1=0, var_89=0] [L191] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83_arg_0=0, var_83_arg_1=0, var_89=0] [L197] EXPR var_83_arg_0 & var_83_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] EXPR var_44 & mask_SORT_43 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85_arg_0=0, var_85_arg_1=1, var_89=0] [L206] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] EXPR var_85 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_54_arg_0=0, var_54_arg_1=1, var_66=3, var_85=0, var_89=0] [L216] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_58_arg_0=0, var_58_arg_1=0, var_66=3, var_85=0, var_89=0] [L222] EXPR var_58_arg_0 & var_58_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_62_arg_0=0, var_62_arg_1=0, var_66=3, var_85=0, var_89=0] [L228] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_64_arg_0=0, var_64_arg_1=1, var_66=3, var_85=0, var_89=0] [L234] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] EXPR var_64 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_33_arg_0=0, var_33_arg_1=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_38_arg_0=0, var_38_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_42_arg_0=0, var_42_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_47_arg_0=0, var_47_arg_1=1, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] EXPR var_47 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_86=0, var_89=0] [L276] EXPR var_86 & mask_SORT_21 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_101_arg_0=0, var_101_arg_1=1, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] EXPR var_101 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] EXPR var_105 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_106=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] EXPR var_106 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_108_arg_0=-1, var_108_arg_1=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113_arg_0=1, var_113_arg_1=-1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] EXPR var_113_arg_0 & var_113_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] EXPR var_113 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2078 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2078 mSDsluCounter, 14810 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11584 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 852 IncrementalHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 3226 mSDtfsCounter, 852 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=8, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1133 NumberOfCodeBlocks, 1133 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1008 ConstructedInterpolants, 0 QuantifiedInterpolants, 3831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:00:12,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:00:14,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:00:14,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 05:00:14,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:00:14,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:00:14,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:00:14,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:00:14,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:00:14,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:00:14,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:00:14,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:00:14,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:00:14,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:00:14,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:00:14,606 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:00:14,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:00:14,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:00:14,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:00:14,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:00:14,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:00:14,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:00:14,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:00:14,612 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:00:14,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:00:14,613 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:00:14,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:00:14,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:00:14,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:00:14,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:00:14,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:00:14,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:00:14,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:00:14,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:00:14,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:00:14,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:00:14,616 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:00:14,616 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:00:14,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:00:14,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:00:14,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:00:14,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:00:14,617 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:00:14,617 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 -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2024-10-24 05:00:14,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:00:14,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:00:14,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:00:14,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:00:14,996 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:00:14,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-10-24 05:00:16,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:00:16,761 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:00:16,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-10-24 05:00:16,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab5d76ec/8e3b44f899ba404cb79d5040684f368e/FLAG0971da90b [2024-10-24 05:00:16,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fab5d76ec/8e3b44f899ba404cb79d5040684f368e [2024-10-24 05:00:16,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:00:16,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:00:16,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:00:16,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:00:16,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:00:16,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:00:16" (1/1) ... [2024-10-24 05:00:16,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c174ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:16, skipping insertion in model container [2024-10-24 05:00:16,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:00:16" (1/1) ... [2024-10-24 05:00:16,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:00:17,075 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-10-24 05:00:17,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:00:17,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:00:17,224 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-10-24 05:00:17,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:00:17,312 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:00:17,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17 WrapperNode [2024-10-24 05:00:17,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:00:17,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:00:17,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:00:17,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:00:17,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,410 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 468 [2024-10-24 05:00:17,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:00:17,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:00:17,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:00:17,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:00:17,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,464 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:00:17,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:00:17,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:00:17,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:00:17,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:00:17,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (1/1) ... [2024-10-24 05:00:17,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:00:17,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:00:17,557 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-10-24 05:00:17,561 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-10-24 05:00:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:00:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:00:17,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:00:17,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:00:17,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:00:17,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:00:18,251 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2024-10-24 05:00:18,252 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:00:18,322 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:00:18,323 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:00:18,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:00:18 BoogieIcfgContainer [2024-10-24 05:00:18,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:00:18,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:00:18,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:00:18,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:00:18,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:00:16" (1/3) ... [2024-10-24 05:00:18,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb20ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:00:18, skipping insertion in model container [2024-10-24 05:00:18,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:00:17" (2/3) ... [2024-10-24 05:00:18,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb20ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:00:18, skipping insertion in model container [2024-10-24 05:00:18,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:00:18" (3/3) ... [2024-10-24 05:00:18,335 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-10-24 05:00:18,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:00:18,353 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:00:18,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:00:18,420 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;@79cc307c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:00:18,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:00:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 05:00:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 05:00:18,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:00:18,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 05:00:18,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:00:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:00:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 05:00:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:00:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211940188] [2024-10-24 05:00:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:00:18,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:00:18,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:00:18,459 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-10-24 05:00:18,461 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-10-24 05:00:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:00:18,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:00:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:00:18,974 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 05:00:18,976 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:00:18,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:00:18,987 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-24 05:00:19,179 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-10-24 05:00:19,185 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-24 05:00:19,247 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:00:19,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:00:19 BoogieIcfgContainer [2024-10-24 05:00:19,253 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:00:19,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:00:19,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:00:19,255 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:00:19,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:00:18" (3/4) ... [2024-10-24 05:00:19,257 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 05:00:19,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 05:00:19,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:00:19,358 INFO L158 Benchmark]: Toolchain (without parser) took 2552.55ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 29.1MB in the beginning and 39.9MB in the end (delta: -10.8MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,358 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 46.1MB. Free memory was 27.4MB in the beginning and 27.3MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:00:19,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.59ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 28.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.28ms. Allocated memory is still 69.2MB. Free memory was 28.7MB in the beginning and 46.3MB in the end (delta: -17.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,358 INFO L158 Benchmark]: Boogie Preprocessor took 97.25ms. Allocated memory is still 69.2MB. Free memory was 46.3MB in the beginning and 41.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,359 INFO L158 Benchmark]: RCFGBuilder took 815.17ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 41.8MB in the beginning and 55.6MB in the end (delta: -13.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,359 INFO L158 Benchmark]: TraceAbstraction took 927.03ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 46.2MB in the end (delta: 8.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,359 INFO L158 Benchmark]: Witness Printer took 101.90ms. Allocated memory is still 86.0MB. Free memory was 46.2MB in the beginning and 39.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:00:19,361 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 46.1MB. Free memory was 27.4MB in the beginning and 27.3MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.59ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 28.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.28ms. Allocated memory is still 69.2MB. Free memory was 28.7MB in the beginning and 46.3MB in the end (delta: -17.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.25ms. Allocated memory is still 69.2MB. Free memory was 46.3MB in the beginning and 41.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 815.17ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 41.8MB in the beginning and 55.6MB in the end (delta: -13.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 927.03ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 46.2MB in the end (delta: 8.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Witness Printer took 101.90ms. Allocated memory is still 86.0MB. Free memory was 46.2MB in the beginning and 39.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2024-10-24 05:00:19,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE