./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label21.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:05:05,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:05:05,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:05:05,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:05:05,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:05:05,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:05:05,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:05:05,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:05:05,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:05:05,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:05:05,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:05:05,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:05:05,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:05:05,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:05:05,300 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:05:05,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:05:05,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:05:05,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:05:05,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:05:05,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:05:05,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:05:05,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:05:05,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:05:05,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:05:05,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:05:05,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:05:05,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:05:05,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:05:05,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:05:05,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:05:05,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:05:05,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:05:05,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:05:05,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:05:05,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:05:05,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:05:05,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:05:05,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:05:05,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:05:05,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:05:05,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:05:05,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:05:05,309 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fc08bc6eca06c500d742b65350dc2aa3c19e672662fd614514fbc6bd34af0fd [2024-11-16 03:05:05,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:05:05,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:05:05,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:05:05,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:05:05,555 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:05:05,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2024-11-16 03:05:06,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:05:07,247 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:05:07,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label21.c [2024-11-16 03:05:07,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94673460/0af89c91cd6f4709adb2ab6b37b6ef9b/FLAGad6b57d03 [2024-11-16 03:05:07,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94673460/0af89c91cd6f4709adb2ab6b37b6ef9b [2024-11-16 03:05:07,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:05:07,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:05:07,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:05:07,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:05:07,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:05:07,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:05:07" (1/1) ... [2024-11-16 03:05:07,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae90e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:07, skipping insertion in model container [2024-11-16 03:05:07,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:05:07" (1/1) ... [2024-11-16 03:05:07,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:05:08,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-16 03:05:08,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:05:08,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:05:08,300 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label21.c[15876,15889] [2024-11-16 03:05:08,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:05:08,356 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:05:08,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08 WrapperNode [2024-11-16 03:05:08,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:05:08,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:05:08,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:05:08,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:05:08,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,486 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-16 03:05:08,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:05:08,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:05:08,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:05:08,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:05:08,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:05:08,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:05:08,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:05:08,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:05:08,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:05:08,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (1/1) ... [2024-11-16 03:05:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:05:08,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:08,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:05:08,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:05:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:05:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:05:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:05:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:05:08,739 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:05:08,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:05:09,395 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-16 03:05:09,395 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:05:09,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:05:09,414 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:05:09,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:05:09 BoogieIcfgContainer [2024-11-16 03:05:09,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:05:09,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:05:09,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:05:09,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:05:09,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:05:07" (1/3) ... [2024-11-16 03:05:09,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4d5785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:05:09, skipping insertion in model container [2024-11-16 03:05:09,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:05:08" (2/3) ... [2024-11-16 03:05:09,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4d5785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:05:09, skipping insertion in model container [2024-11-16 03:05:09,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:05:09" (3/3) ... [2024-11-16 03:05:09,420 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label21.c [2024-11-16 03:05:09,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:05:09,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:05:09,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:05:09,482 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;@28fe3dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:05:09,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:05:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 03:05:09,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:09,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:09,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -965559372, now seen corresponding path program 1 times [2024-11-16 03:05:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967827335] [2024-11-16 03:05:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967827335] [2024-11-16 03:05:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967827335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:05:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868951390] [2024-11-16 03:05:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:09,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:09,828 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 0 states have call successors, (0), 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 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:10,432 INFO L93 Difference]: Finished difference Result 559 states and 946 transitions. [2024-11-16 03:05:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-16 03:05:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:10,442 INFO L225 Difference]: With dead ends: 559 [2024-11-16 03:05:10,442 INFO L226 Difference]: Without dead ends: 269 [2024-11-16 03:05:10,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:10,447 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:10,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 76 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:05:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-16 03:05:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-16 03:05:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4291044776119404) internal successors, (383), 268 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 383 transitions. [2024-11-16 03:05:10,489 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 383 transitions. Word has length 85 [2024-11-16 03:05:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:10,489 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 383 transitions. [2024-11-16 03:05:10,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 383 transitions. [2024-11-16 03:05:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 03:05:10,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:10,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:05:10,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:10,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1626820114, now seen corresponding path program 1 times [2024-11-16 03:05:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:10,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753573535] [2024-11-16 03:05:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:10,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753573535] [2024-11-16 03:05:10,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753573535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:10,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:10,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:05:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69339537] [2024-11-16 03:05:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:10,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:10,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:10,571 INFO L87 Difference]: Start difference. First operand 269 states and 383 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:10,921 INFO L93 Difference]: Finished difference Result 800 states and 1143 transitions. [2024-11-16 03:05:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:10,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-16 03:05:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:10,924 INFO L225 Difference]: With dead ends: 800 [2024-11-16 03:05:10,924 INFO L226 Difference]: Without dead ends: 533 [2024-11-16 03:05:10,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:10,926 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:10,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 42 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-16 03:05:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-16 03:05:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.3402255639097744) internal successors, (713), 532 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 713 transitions. [2024-11-16 03:05:10,948 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 713 transitions. Word has length 92 [2024-11-16 03:05:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:10,948 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 713 transitions. [2024-11-16 03:05:10,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 713 transitions. [2024-11-16 03:05:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 03:05:10,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:10,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:10,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:05:10,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:10,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1177013282, now seen corresponding path program 1 times [2024-11-16 03:05:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477572762] [2024-11-16 03:05:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477572762] [2024-11-16 03:05:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477572762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:11,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028904480] [2024-11-16 03:05:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:11,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:11,051 INFO L87 Difference]: Start difference. First operand 533 states and 713 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:11,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:11,521 INFO L93 Difference]: Finished difference Result 1592 states and 2133 transitions. [2024-11-16 03:05:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:11,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-16 03:05:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:11,528 INFO L225 Difference]: With dead ends: 1592 [2024-11-16 03:05:11,528 INFO L226 Difference]: Without dead ends: 1061 [2024-11-16 03:05:11,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:11,534 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 135 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:11,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:05:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-16 03:05:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 797. [2024-11-16 03:05:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.265075376884422) internal successors, (1007), 796 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1007 transitions. [2024-11-16 03:05:11,584 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1007 transitions. Word has length 98 [2024-11-16 03:05:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1007 transitions. [2024-11-16 03:05:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1007 transitions. [2024-11-16 03:05:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 03:05:11,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:11,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:05:11,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:11,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1711112188, now seen corresponding path program 1 times [2024-11-16 03:05:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932926522] [2024-11-16 03:05:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 03:05:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932926522] [2024-11-16 03:05:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932926522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:05:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797278832] [2024-11-16 03:05:11,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:11,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:11,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:11,684 INFO L87 Difference]: Start difference. First operand 797 states and 1007 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:12,001 INFO L93 Difference]: Finished difference Result 1724 states and 2168 transitions. [2024-11-16 03:05:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:12,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-16 03:05:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:12,004 INFO L225 Difference]: With dead ends: 1724 [2024-11-16 03:05:12,004 INFO L226 Difference]: Without dead ends: 929 [2024-11-16 03:05:12,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:12,006 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 160 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:12,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 32 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-16 03:05:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 797. [2024-11-16 03:05:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.2198492462311559) internal successors, (971), 796 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 971 transitions. [2024-11-16 03:05:12,023 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 971 transitions. Word has length 110 [2024-11-16 03:05:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:12,023 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 971 transitions. [2024-11-16 03:05:12,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 971 transitions. [2024-11-16 03:05:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 03:05:12,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:12,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:12,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:05:12,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1687137778, now seen corresponding path program 1 times [2024-11-16 03:05:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99906656] [2024-11-16 03:05:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:05:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99906656] [2024-11-16 03:05:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99906656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:12,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:12,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:05:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436992468] [2024-11-16 03:05:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:12,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:12,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:12,168 INFO L87 Difference]: Start difference. First operand 797 states and 971 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:12,484 INFO L93 Difference]: Finished difference Result 1724 states and 2078 transitions. [2024-11-16 03:05:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:12,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-16 03:05:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:12,486 INFO L225 Difference]: With dead ends: 1724 [2024-11-16 03:05:12,487 INFO L226 Difference]: Without dead ends: 797 [2024-11-16 03:05:12,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:12,488 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:12,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 66 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-16 03:05:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2024-11-16 03:05:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.1180904522613064) internal successors, (890), 796 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 890 transitions. [2024-11-16 03:05:12,499 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 890 transitions. Word has length 114 [2024-11-16 03:05:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:12,499 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 890 transitions. [2024-11-16 03:05:12,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 890 transitions. [2024-11-16 03:05:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 03:05:12,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:12,501 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:12,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:05:12,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:12,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1602802403, now seen corresponding path program 1 times [2024-11-16 03:05:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99665760] [2024-11-16 03:05:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:12,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:05:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99665760] [2024-11-16 03:05:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99665760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292438147] [2024-11-16 03:05:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:12,615 INFO L87 Difference]: Start difference. First operand 797 states and 890 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:13,105 INFO L93 Difference]: Finished difference Result 2120 states and 2388 transitions. [2024-11-16 03:05:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-16 03:05:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:13,109 INFO L225 Difference]: With dead ends: 2120 [2024-11-16 03:05:13,110 INFO L226 Difference]: Without dead ends: 1325 [2024-11-16 03:05:13,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:13,111 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 255 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:13,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 43 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:05:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-16 03:05:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1193. [2024-11-16 03:05:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1192 states have (on average 1.1048657718120805) internal successors, (1317), 1192 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1317 transitions. [2024-11-16 03:05:13,128 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1317 transitions. Word has length 119 [2024-11-16 03:05:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:13,128 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1317 transitions. [2024-11-16 03:05:13,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1317 transitions. [2024-11-16 03:05:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 03:05:13,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:13,130 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:05:13,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:13,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1412385805, now seen corresponding path program 1 times [2024-11-16 03:05:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666407444] [2024-11-16 03:05:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-16 03:05:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666407444] [2024-11-16 03:05:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666407444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072593708] [2024-11-16 03:05:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:13,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:13,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:13,234 INFO L87 Difference]: Start difference. First operand 1193 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:13,514 INFO L93 Difference]: Finished difference Result 3308 states and 3670 transitions. [2024-11-16 03:05:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-11-16 03:05:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:13,519 INFO L225 Difference]: With dead ends: 3308 [2024-11-16 03:05:13,519 INFO L226 Difference]: Without dead ends: 2117 [2024-11-16 03:05:13,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:13,522 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 136 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:13,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 16 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2024-11-16 03:05:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1721. [2024-11-16 03:05:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.1151162790697675) internal successors, (1918), 1720 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 1918 transitions. [2024-11-16 03:05:13,545 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 1918 transitions. Word has length 129 [2024-11-16 03:05:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 1918 transitions. [2024-11-16 03:05:13,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 1918 transitions. [2024-11-16 03:05:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 03:05:13,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:13,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:05:13,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 897548144, now seen corresponding path program 1 times [2024-11-16 03:05:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297641862] [2024-11-16 03:05:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-16 03:05:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297641862] [2024-11-16 03:05:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297641862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:05:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943930204] [2024-11-16 03:05:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:13,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:13,704 INFO L87 Difference]: Start difference. First operand 1721 states and 1918 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:13,993 INFO L93 Difference]: Finished difference Result 3572 states and 3987 transitions. [2024-11-16 03:05:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 144 [2024-11-16 03:05:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:14,003 INFO L225 Difference]: With dead ends: 3572 [2024-11-16 03:05:14,004 INFO L226 Difference]: Without dead ends: 1853 [2024-11-16 03:05:14,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:14,010 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:14,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 47 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-16 03:05:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2024-11-16 03:05:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.1128509719222461) internal successors, (2061), 1852 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2061 transitions. [2024-11-16 03:05:14,061 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2061 transitions. Word has length 144 [2024-11-16 03:05:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:14,062 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2061 transitions. [2024-11-16 03:05:14,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2061 transitions. [2024-11-16 03:05:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 03:05:14,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:14,067 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:14,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:05:14,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:14,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -510107301, now seen corresponding path program 1 times [2024-11-16 03:05:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464403303] [2024-11-16 03:05:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:05:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:14,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464403303] [2024-11-16 03:05:14,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464403303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:14,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:14,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:05:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842170564] [2024-11-16 03:05:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:14,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:14,239 INFO L87 Difference]: Start difference. First operand 1853 states and 2061 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:14,946 INFO L93 Difference]: Finished difference Result 4892 states and 5434 transitions. [2024-11-16 03:05:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 149 [2024-11-16 03:05:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:14,952 INFO L225 Difference]: With dead ends: 4892 [2024-11-16 03:05:14,953 INFO L226 Difference]: Without dead ends: 2777 [2024-11-16 03:05:14,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:14,955 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 245 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:14,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 47 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:05:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2024-11-16 03:05:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 1589. [2024-11-16 03:05:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.1007556675062973) internal successors, (1748), 1588 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1748 transitions. [2024-11-16 03:05:14,977 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1748 transitions. Word has length 149 [2024-11-16 03:05:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1748 transitions. [2024-11-16 03:05:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1748 transitions. [2024-11-16 03:05:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 03:05:14,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:14,979 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:14,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:05:14,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1250569079, now seen corresponding path program 1 times [2024-11-16 03:05:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005996317] [2024-11-16 03:05:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:05:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005996317] [2024-11-16 03:05:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005996317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658805296] [2024-11-16 03:05:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:15,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:15,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:05:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:15,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:15,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-16 03:05:15,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658805296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:15,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:15,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666606359] [2024-11-16 03:05:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:15,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:15,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:15,584 INFO L87 Difference]: Start difference. First operand 1589 states and 1748 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:15,851 INFO L93 Difference]: Finished difference Result 2252 states and 2481 transitions. [2024-11-16 03:05:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 166 [2024-11-16 03:05:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:15,858 INFO L225 Difference]: With dead ends: 2252 [2024-11-16 03:05:15,858 INFO L226 Difference]: Without dead ends: 2249 [2024-11-16 03:05:15,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:15,859 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:15,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 33 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2024-11-16 03:05:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1589. [2024-11-16 03:05:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.1007556675062973) internal successors, (1748), 1588 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1748 transitions. [2024-11-16 03:05:15,899 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1748 transitions. Word has length 166 [2024-11-16 03:05:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:15,900 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 1748 transitions. [2024-11-16 03:05:15,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1748 transitions. [2024-11-16 03:05:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-16 03:05:15,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:15,902 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:15,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 03:05:16,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 03:05:16,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:16,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:16,104 INFO L85 PathProgramCache]: Analyzing trace with hash 80404899, now seen corresponding path program 1 times [2024-11-16 03:05:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:16,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308768869] [2024-11-16 03:05:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:16,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 129 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308768869] [2024-11-16 03:05:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308768869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30105233] [2024-11-16 03:05:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:16,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:16,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:16,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:16,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:05:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:16,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 03:05:16,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-16 03:05:16,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30105233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75625855] [2024-11-16 03:05:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:16,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:16,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:16,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:16,910 INFO L87 Difference]: Start difference. First operand 1589 states and 1748 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:17,179 INFO L93 Difference]: Finished difference Result 3308 states and 3655 transitions. [2024-11-16 03:05:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 207 [2024-11-16 03:05:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:17,183 INFO L225 Difference]: With dead ends: 3308 [2024-11-16 03:05:17,184 INFO L226 Difference]: Without dead ends: 1853 [2024-11-16 03:05:17,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:17,185 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:17,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 39 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-16 03:05:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1721. [2024-11-16 03:05:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.1046511627906976) internal successors, (1900), 1720 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 1900 transitions. [2024-11-16 03:05:17,206 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 1900 transitions. Word has length 207 [2024-11-16 03:05:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:17,206 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 1900 transitions. [2024-11-16 03:05:17,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 1900 transitions. [2024-11-16 03:05:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-16 03:05:17,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:17,209 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:17,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 03:05:17,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 03:05:17,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:17,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1681551213, now seen corresponding path program 1 times [2024-11-16 03:05:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206153103] [2024-11-16 03:05:17,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:17,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-16 03:05:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206153103] [2024-11-16 03:05:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206153103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654400668] [2024-11-16 03:05:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:05:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:05:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:17,643 INFO L87 Difference]: Start difference. First operand 1721 states and 1900 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:18,120 INFO L93 Difference]: Finished difference Result 3572 states and 3961 transitions. [2024-11-16 03:05:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2024-11-16 03:05:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:18,125 INFO L225 Difference]: With dead ends: 3572 [2024-11-16 03:05:18,125 INFO L226 Difference]: Without dead ends: 1985 [2024-11-16 03:05:18,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:05:18,127 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 251 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:18,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 52 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:05:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-11-16 03:05:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1853. [2024-11-16 03:05:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.0982721382289418) internal successors, (2034), 1852 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2034 transitions. [2024-11-16 03:05:18,147 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2034 transitions. Word has length 234 [2024-11-16 03:05:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:18,148 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2034 transitions. [2024-11-16 03:05:18,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2034 transitions. [2024-11-16 03:05:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-16 03:05:18,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:18,151 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:18,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 03:05:18,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:18,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1988719985, now seen corresponding path program 1 times [2024-11-16 03:05:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:18,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264385818] [2024-11-16 03:05:18,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:18,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-16 03:05:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264385818] [2024-11-16 03:05:18,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264385818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766773622] [2024-11-16 03:05:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:18,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:18,303 INFO L87 Difference]: Start difference. First operand 1853 states and 2034 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:18,607 INFO L93 Difference]: Finished difference Result 3836 states and 4223 transitions. [2024-11-16 03:05:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 251 [2024-11-16 03:05:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:18,612 INFO L225 Difference]: With dead ends: 3836 [2024-11-16 03:05:18,612 INFO L226 Difference]: Without dead ends: 2117 [2024-11-16 03:05:18,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:18,614 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 86 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:18,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 182 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2024-11-16 03:05:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2117. [2024-11-16 03:05:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.0883742911153118) internal successors, (2303), 2116 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2303 transitions. [2024-11-16 03:05:18,644 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2303 transitions. Word has length 251 [2024-11-16 03:05:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:18,645 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 2303 transitions. [2024-11-16 03:05:18,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2303 transitions. [2024-11-16 03:05:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-16 03:05:18,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:18,649 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 03:05:18,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash -978960318, now seen corresponding path program 1 times [2024-11-16 03:05:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692711609] [2024-11-16 03:05:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-16 03:05:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692711609] [2024-11-16 03:05:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692711609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047921706] [2024-11-16 03:05:18,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:18,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:18,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:18,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:18,779 INFO L87 Difference]: Start difference. First operand 2117 states and 2303 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:19,123 INFO L93 Difference]: Finished difference Result 4232 states and 4621 transitions. [2024-11-16 03:05:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 265 [2024-11-16 03:05:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:19,131 INFO L225 Difference]: With dead ends: 4232 [2024-11-16 03:05:19,131 INFO L226 Difference]: Without dead ends: 2249 [2024-11-16 03:05:19,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:19,137 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 98 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:19,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 170 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2024-11-16 03:05:19,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2249. [2024-11-16 03:05:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2248 states have (on average 1.0778469750889679) internal successors, (2423), 2248 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 2423 transitions. [2024-11-16 03:05:19,164 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 2423 transitions. Word has length 265 [2024-11-16 03:05:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:19,164 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 2423 transitions. [2024-11-16 03:05:19,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:05:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 2423 transitions. [2024-11-16 03:05:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-16 03:05:19,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:19,168 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:19,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:05:19,168 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:19,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash 939319462, now seen corresponding path program 1 times [2024-11-16 03:05:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:19,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607007926] [2024-11-16 03:05:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:19,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:05:19,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 03:05:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:05:19,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 03:05:19,287 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 03:05:19,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:05:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:05:19,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:19,408 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:05:19,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:05:19 BoogieIcfgContainer [2024-11-16 03:05:19,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:05:19,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:05:19,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:05:19,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:05:19,411 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:05:09" (3/4) ... [2024-11-16 03:05:19,412 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 03:05:19,512 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:05:19,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:05:19,513 INFO L158 Benchmark]: Toolchain (without parser) took 12032.75ms. Allocated memory was 144.7MB in the beginning and 505.4MB in the end (delta: 360.7MB). Free memory was 71.2MB in the beginning and 185.5MB in the end (delta: -114.3MB). Peak memory consumption was 246.7MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,513 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:05:19,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 879.53ms. Allocated memory was 144.7MB in the beginning and 243.3MB in the end (delta: 98.6MB). Free memory was 71.0MB in the beginning and 188.0MB in the end (delta: -117.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.45ms. Allocated memory is still 243.3MB. Free memory was 188.0MB in the beginning and 181.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,514 INFO L158 Benchmark]: Boogie Preprocessor took 118.11ms. Allocated memory is still 243.3MB. Free memory was 181.7MB in the beginning and 176.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,514 INFO L158 Benchmark]: IcfgBuilder took 809.07ms. Allocated memory is still 243.3MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,514 INFO L158 Benchmark]: TraceAbstraction took 9994.73ms. Allocated memory was 243.3MB in the beginning and 505.4MB in the end (delta: 262.1MB). Free memory was 173.9MB in the beginning and 217.0MB in the end (delta: -43.1MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,514 INFO L158 Benchmark]: Witness Printer took 101.85ms. Allocated memory is still 505.4MB. Free memory was 217.0MB in the beginning and 185.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 03:05:19,515 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.14ms. Allocated memory is still 144.7MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 879.53ms. Allocated memory was 144.7MB in the beginning and 243.3MB in the end (delta: 98.6MB). Free memory was 71.0MB in the beginning and 188.0MB in the end (delta: -117.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.45ms. Allocated memory is still 243.3MB. Free memory was 188.0MB in the beginning and 181.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.11ms. Allocated memory is still 243.3MB. Free memory was 181.7MB in the beginning and 176.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 809.07ms. Allocated memory is still 243.3MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9994.73ms. Allocated memory was 243.3MB in the beginning and 505.4MB in the end (delta: 262.1MB). Free memory was 173.9MB in the beginning and 217.0MB in the end (delta: -43.1MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. * Witness Printer took 101.85ms. Allocated memory is still 505.4MB. Free memory was 217.0MB in the beginning and 185.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. 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: 435]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND TRUE ((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))) [L393] a20 = 0 [L394] a21 = 1 [L395] a8 = 14 [L396] a17 = 0 [L397] a16 = 5 [L398] a7 = 1 [L399] return -1; VAL [\result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L434] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L435] reach_error() VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 201 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1987 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1987 mSDsluCounter, 1043 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5347 IncrementalHoareTripleChecker+Invalid, 5940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 593 mSolverCounterUnsat, 913 mSDtfsCounter, 5347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2249occurred in iteration=14, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 3036 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2809 NumberOfCodeBlocks, 2809 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2520 ConstructedInterpolants, 0 QuantifiedInterpolants, 6976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 1957/2020 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-11-16 03:05:19,549 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