/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 20:20:06,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 20:20:06,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 20:20:06,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 20:20:06,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 20:20:06,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 20:20:06,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 20:20:06,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 20:20:06,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 20:20:06,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 20:20:06,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 20:20:06,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 20:20:06,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 20:20:06,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 20:20:06,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 20:20:06,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 20:20:06,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 20:20:06,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 20:20:06,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 20:20:06,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 20:20:06,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 20:20:06,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 20:20:06,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 20:20:06,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 20:20:06,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 20:20:06,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 20:20:06,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 20:20:06,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 20:20:06,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 20:20:06,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 20:20:06,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 20:20:06,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 20:20:06,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 20:20:06,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 20:20:06,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 20:20:06,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 20:20:06,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 20:20:06,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 20:20:06,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 20:20:06,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 20:20:06,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 20:20:06,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 20:20:06,606 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 20:20:06,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 20:20:06,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 20:20:06,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 20:20:06,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 20:20:06,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 20:20:06,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 20:20:06,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 20:20:06,607 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 20:20:06,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 20:20:06,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 20:20:06,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:20:06,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 20:20:06,609 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 20:20:06,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 20:20:06,610 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 20:20:06,610 INFO L138 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 [2023-04-01 20:20:06,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 20:20:06,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 20:20:06,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 20:20:06,802 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 20:20:06,804 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 20:20:06,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2023-04-01 20:20:07,796 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 20:20:07,978 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 20:20:07,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2023-04-01 20:20:07,986 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43e4f4a3/72115f0d34294d05b385235f4c264934/FLAGa04ff72ad [2023-04-01 20:20:07,997 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43e4f4a3/72115f0d34294d05b385235f4c264934 [2023-04-01 20:20:07,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 20:20:07,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 20:20:08,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 20:20:08,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 20:20:08,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 20:20:08,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:20:07" (1/1) ... [2023-04-01 20:20:08,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbae3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08, skipping insertion in model container [2023-04-01 20:20:08,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:20:07" (1/1) ... [2023-04-01 20:20:08,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 20:20:08,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 20:20:08,218 WARN L247 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_label33.c[15127,15140] [2023-04-01 20:20:08,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:20:08,262 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 20:20:08,314 WARN L247 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_label33.c[15127,15140] [2023-04-01 20:20:08,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:20:08,348 INFO L208 MainTranslator]: Completed translation [2023-04-01 20:20:08,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08 WrapperNode [2023-04-01 20:20:08,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 20:20:08,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 20:20:08,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 20:20:08,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 20:20:08,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,409 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 20:20:08,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 20:20:08,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 20:20:08,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 20:20:08,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (1/1) ... [2023-04-01 20:20:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:20:08,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:08,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 20:20:08,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 20:20:08,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 20:20:08,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 20:20:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 20:20:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-04-01 20:20:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 20:20:08,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 20:20:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 20:20:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 20:20:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 20:20:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 20:20:08,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 20:20:08,564 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 20:20:08,566 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 20:20:09,259 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 20:20:09,268 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 20:20:09,268 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 20:20:09,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:20:09 BoogieIcfgContainer [2023-04-01 20:20:09,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 20:20:09,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 20:20:09,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 20:20:09,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 20:20:09,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 08:20:07" (1/3) ... [2023-04-01 20:20:09,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fbba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:20:09, skipping insertion in model container [2023-04-01 20:20:09,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:20:08" (2/3) ... [2023-04-01 20:20:09,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fbba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:20:09, skipping insertion in model container [2023-04-01 20:20:09,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:20:09" (3/3) ... [2023-04-01 20:20:09,280 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label33.c [2023-04-01 20:20:09,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 20:20:09,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 20:20:09,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 20:20:09,353 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4e3fb9fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 20:20:09,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 20:20:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:20:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-04-01 20:20:09,367 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:09,368 INFO L195 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] [2023-04-01 20:20:09,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:09,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2004217960, now seen corresponding path program 1 times [2023-04-01 20:20:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007561225] [2023-04-01 20:20:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:20:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:09,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007561225] [2023-04-01 20:20:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007561225] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:20:09,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:20:09,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 20:20:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420806295] [2023-04-01 20:20:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:20:09,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 20:20:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 20:20:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 20:20:09,975 INFO L87 Difference]: Start difference. First operand has 207 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 20:20:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:10,923 INFO L93 Difference]: Finished difference Result 557 states and 955 transitions. [2023-04-01 20:20:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 20:20:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2023-04-01 20:20:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:10,933 INFO L225 Difference]: With dead ends: 557 [2023-04-01 20:20:10,933 INFO L226 Difference]: Without dead ends: 286 [2023-04-01 20:20:10,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-01 20:20:10,941 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 473 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:10,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 25 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 20:20:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-04-01 20:20:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2023-04-01 20:20:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 272 states have (on average 1.400735294117647) internal successors, (381), 274 states have internal predecessors, (381), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 20:20:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 392 transitions. [2023-04-01 20:20:10,991 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 392 transitions. Word has length 83 [2023-04-01 20:20:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:10,991 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 392 transitions. [2023-04-01 20:20:10,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 20:20:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 392 transitions. [2023-04-01 20:20:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-04-01 20:20:10,994 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:10,994 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-04-01 20:20:10,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 20:20:10,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:10,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -166857158, now seen corresponding path program 1 times [2023-04-01 20:20:10,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996655076] [2023-04-01 20:20:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 20:20:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:11,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996655076] [2023-04-01 20:20:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996655076] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:11,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827612412] [2023-04-01 20:20:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:11,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:11,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:11,300 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) [2023-04-01 20:20:11,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 20:20:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:11,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 20:20:11,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 20:20:11,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 20:20:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827612412] provided 1 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:11,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:20:11,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2023-04-01 20:20:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794097236] [2023-04-01 20:20:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:20:11,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 20:20:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:11,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 20:20:11,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-01 20:20:11,765 INFO L87 Difference]: Start difference. First operand 282 states and 392 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:20:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:12,086 INFO L93 Difference]: Finished difference Result 836 states and 1181 transitions. [2023-04-01 20:20:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 20:20:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2023-04-01 20:20:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:12,090 INFO L225 Difference]: With dead ends: 836 [2023-04-01 20:20:12,090 INFO L226 Difference]: Without dead ends: 560 [2023-04-01 20:20:12,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-01 20:20:12,092 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 319 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:12,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 26 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:20:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-04-01 20:20:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2023-04-01 20:20:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 542 states have (on average 1.3339483394833949) internal successors, (723), 548 states have internal predecessors, (723), 6 states have call successors, (6), 6 states have call predecessors, (6), 11 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-04-01 20:20:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 754 transitions. [2023-04-01 20:20:12,118 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 754 transitions. Word has length 91 [2023-04-01 20:20:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:12,118 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 754 transitions. [2023-04-01 20:20:12,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:20:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 754 transitions. [2023-04-01 20:20:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-04-01 20:20:12,121 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:12,121 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-04-01 20:20:12,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 20:20:12,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:12,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:12,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1611515678, now seen corresponding path program 1 times [2023-04-01 20:20:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:12,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602457751] [2023-04-01 20:20:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:12,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-01 20:20:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:20:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602457751] [2023-04-01 20:20:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602457751] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31760854] [2023-04-01 20:20:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:12,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:12,634 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) [2023-04-01 20:20:12,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 20:20:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:12,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:20:12,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:20:12,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:20:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31760854] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:20:12,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:20:12,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2023-04-01 20:20:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303941127] [2023-04-01 20:20:12,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:20:12,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 20:20:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:12,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 20:20:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:20:12,836 INFO L87 Difference]: Start difference. First operand 560 states and 754 transitions. Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 6 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 20:20:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:14,640 INFO L93 Difference]: Finished difference Result 2631 states and 3619 transitions. [2023-04-01 20:20:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 20:20:14,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 6 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 102 [2023-04-01 20:20:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:14,645 INFO L225 Difference]: With dead ends: 2631 [2023-04-01 20:20:14,645 INFO L226 Difference]: Without dead ends: 1521 [2023-04-01 20:20:14,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2023-04-01 20:20:14,648 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2718 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:14,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2718 Valid, 84 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-01 20:20:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2023-04-01 20:20:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 842. [2023-04-01 20:20:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 814 states have (on average 1.1879606879606879) internal successors, (967), 826 states have internal predecessors, (967), 8 states have call successors, (8), 8 states have call predecessors, (8), 19 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2023-04-01 20:20:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1006 transitions. [2023-04-01 20:20:14,679 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1006 transitions. Word has length 102 [2023-04-01 20:20:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:14,679 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1006 transitions. [2023-04-01 20:20:14,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 13 states have internal predecessors, (114), 6 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 20:20:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1006 transitions. [2023-04-01 20:20:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-04-01 20:20:14,681 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:14,682 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:20:14,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:14,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 20:20:14,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:14,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -335716742, now seen corresponding path program 1 times [2023-04-01 20:20:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096651047] [2023-04-01 20:20:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-01 20:20:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:20:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096651047] [2023-04-01 20:20:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096651047] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:15,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523859752] [2023-04-01 20:20:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:15,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:15,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 20:20:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:15,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:20:15,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:20:15,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:20:15,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523859752] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:20:15,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:20:15,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-04-01 20:20:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572287145] [2023-04-01 20:20:15,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:20:15,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:20:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:20:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:20:15,320 INFO L87 Difference]: Start difference. First operand 842 states and 1006 transitions. Second operand has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 10 states have internal predecessors, (143), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 20:20:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:16,727 INFO L93 Difference]: Finished difference Result 3331 states and 4280 transitions. [2023-04-01 20:20:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 20:20:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 10 states have internal predecessors, (143), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 114 [2023-04-01 20:20:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:16,740 INFO L225 Difference]: With dead ends: 3331 [2023-04-01 20:20:16,741 INFO L226 Difference]: Without dead ends: 2495 [2023-04-01 20:20:16,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2023-04-01 20:20:16,744 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1047 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:16,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 105 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-01 20:20:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2023-04-01 20:20:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2457. [2023-04-01 20:20:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2355 states have (on average 1.1507430997876857) internal successors, (2710), 2406 states have internal predecessors, (2710), 32 states have call successors, (32), 19 states have call predecessors, (32), 69 states have return successors, (284), 31 states have call predecessors, (284), 31 states have call successors, (284) [2023-04-01 20:20:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3026 transitions. [2023-04-01 20:20:16,813 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3026 transitions. Word has length 114 [2023-04-01 20:20:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:16,814 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 3026 transitions. [2023-04-01 20:20:16,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.916666666666666) internal successors, (143), 10 states have internal predecessors, (143), 4 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 20:20:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3026 transitions. [2023-04-01 20:20:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-04-01 20:20:16,818 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:16,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-04-01 20:20:16,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:17,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:17,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:17,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash 84318978, now seen corresponding path program 1 times [2023-04-01 20:20:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25334305] [2023-04-01 20:20:17,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-01 20:20:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:20:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25334305] [2023-04-01 20:20:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25334305] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586189628] [2023-04-01 20:20:17,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:17,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:17,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:17,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 20:20:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:17,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 20:20:17,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-01 20:20:17,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 20:20:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586189628] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:20:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 20:20:17,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-04-01 20:20:17,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480991258] [2023-04-01 20:20:17,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:20:17,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 20:20:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:17,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 20:20:17,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-01 20:20:17,551 INFO L87 Difference]: Start difference. First operand 2457 states and 3026 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:20:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:17,996 INFO L93 Difference]: Finished difference Result 5927 states and 7514 transitions. [2023-04-01 20:20:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 20:20:17,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 118 [2023-04-01 20:20:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:18,035 INFO L225 Difference]: With dead ends: 5927 [2023-04-01 20:20:18,035 INFO L226 Difference]: Without dead ends: 3480 [2023-04-01 20:20:18,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-04-01 20:20:18,040 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 405 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:18,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 57 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:20:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2023-04-01 20:20:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3458. [2023-04-01 20:20:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3317 states have (on average 1.1432016882725353) internal successors, (3792), 3390 states have internal predecessors, (3792), 42 states have call successors, (42), 26 states have call predecessors, (42), 98 states have return successors, (438), 41 states have call predecessors, (438), 41 states have call successors, (438) [2023-04-01 20:20:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4272 transitions. [2023-04-01 20:20:18,140 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4272 transitions. Word has length 118 [2023-04-01 20:20:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:18,140 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4272 transitions. [2023-04-01 20:20:18,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:20:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4272 transitions. [2023-04-01 20:20:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-04-01 20:20:18,146 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:18,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2023-04-01 20:20:18,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:18,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:18,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:18,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 968224602, now seen corresponding path program 1 times [2023-04-01 20:20:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414547745] [2023-04-01 20:20:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:18,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-04-01 20:20:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-04-01 20:20:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 20:20:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414547745] [2023-04-01 20:20:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414547745] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:18,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218925177] [2023-04-01 20:20:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:18,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:18,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:18,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:18,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 20:20:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:18,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 20:20:18,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-04-01 20:20:18,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 20:20:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218925177] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:20:19,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:20:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-04-01 20:20:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068127453] [2023-04-01 20:20:19,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:20:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:20:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:20:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:20:19,201 INFO L87 Difference]: Start difference. First operand 3458 states and 4272 transitions. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 10 states have internal predecessors, (147), 5 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-04-01 20:20:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:21,368 INFO L93 Difference]: Finished difference Result 7609 states and 9534 transitions. [2023-04-01 20:20:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 20:20:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 10 states have internal predecessors, (147), 5 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 129 [2023-04-01 20:20:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:21,381 INFO L225 Difference]: With dead ends: 7609 [2023-04-01 20:20:21,381 INFO L226 Difference]: Without dead ends: 3686 [2023-04-01 20:20:21,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 20:20:21,406 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2158 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:21,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 92 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-01 20:20:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2023-04-01 20:20:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 2145. [2023-04-01 20:20:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2064 states have (on average 1.069767441860465) internal successors, (2208), 2102 states have internal predecessors, (2208), 26 states have call successors, (26), 17 states have call predecessors, (26), 54 states have return successors, (183), 25 states have call predecessors, (183), 25 states have call successors, (183) [2023-04-01 20:20:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2417 transitions. [2023-04-01 20:20:21,470 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2417 transitions. Word has length 129 [2023-04-01 20:20:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:21,470 INFO L495 AbstractCegarLoop]: Abstraction has 2145 states and 2417 transitions. [2023-04-01 20:20:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 10 states have internal predecessors, (147), 5 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-04-01 20:20:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2417 transitions. [2023-04-01 20:20:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-04-01 20:20:21,474 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:21,474 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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] [2023-04-01 20:20:21,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:21,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:21,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:21,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:21,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1388160200, now seen corresponding path program 1 times [2023-04-01 20:20:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:21,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105886458] [2023-04-01 20:20:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-01 20:20:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-01 20:20:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-04-01 20:20:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-04-01 20:20:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105886458] [2023-04-01 20:20:21,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105886458] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582738206] [2023-04-01 20:20:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:21,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:21,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:21,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 20:20:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:21,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:20:21,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-04-01 20:20:22,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 58 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 20:20:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582738206] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:20:22,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:20:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2023-04-01 20:20:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672979168] [2023-04-01 20:20:22,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:20:22,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:20:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:20:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:20:22,064 INFO L87 Difference]: Start difference. First operand 2145 states and 2417 transitions. Second operand has 12 states, 12 states have (on average 11.25) internal successors, (135), 10 states have internal predecessors, (135), 4 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 20:20:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:22,766 INFO L93 Difference]: Finished difference Result 5023 states and 5808 transitions. [2023-04-01 20:20:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 20:20:22,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 10 states have internal predecessors, (135), 4 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 139 [2023-04-01 20:20:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:22,777 INFO L225 Difference]: With dead ends: 5023 [2023-04-01 20:20:22,777 INFO L226 Difference]: Without dead ends: 3019 [2023-04-01 20:20:22,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-04-01 20:20:22,783 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1097 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:22,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 45 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 20:20:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2023-04-01 20:20:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 2699. [2023-04-01 20:20:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2605 states have (on average 1.0771593090211133) internal successors, (2806), 2646 states have internal predecessors, (2806), 32 states have call successors, (32), 21 states have call predecessors, (32), 61 states have return successors, (266), 31 states have call predecessors, (266), 31 states have call successors, (266) [2023-04-01 20:20:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3104 transitions. [2023-04-01 20:20:22,850 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3104 transitions. Word has length 139 [2023-04-01 20:20:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:22,851 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3104 transitions. [2023-04-01 20:20:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.25) internal successors, (135), 10 states have internal predecessors, (135), 4 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 20:20:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3104 transitions. [2023-04-01 20:20:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-04-01 20:20:22,855 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:22,856 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2023-04-01 20:20:22,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:23,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:23,061 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:23,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 34516206, now seen corresponding path program 1 times [2023-04-01 20:20:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364401575] [2023-04-01 20:20:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:23,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:23,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-04-01 20:20:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-01 20:20:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 20:20:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364401575] [2023-04-01 20:20:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364401575] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883669769] [2023-04-01 20:20:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:23,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:23,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 20:20:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:23,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 20:20:23,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-04-01 20:20:23,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 20:20:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883669769] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:20:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 20:20:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-04-01 20:20:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991612833] [2023-04-01 20:20:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:20:23,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 20:20:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:23,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 20:20:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-04-01 20:20:23,580 INFO L87 Difference]: Start difference. First operand 2699 states and 3104 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:20:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:23,966 INFO L93 Difference]: Finished difference Result 5082 states and 5740 transitions. [2023-04-01 20:20:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 20:20:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 151 [2023-04-01 20:20:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:23,973 INFO L225 Difference]: With dead ends: 5082 [2023-04-01 20:20:23,973 INFO L226 Difference]: Without dead ends: 2524 [2023-04-01 20:20:23,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-04-01 20:20:23,979 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 360 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:23,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 59 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:20:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2023-04-01 20:20:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2383. [2023-04-01 20:20:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2305 states have (on average 1.060303687635575) internal successors, (2444), 2345 states have internal predecessors, (2444), 19 states have call successors, (19), 19 states have call predecessors, (19), 58 states have return successors, (124), 18 states have call predecessors, (124), 18 states have call successors, (124) [2023-04-01 20:20:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 2587 transitions. [2023-04-01 20:20:24,025 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 2587 transitions. Word has length 151 [2023-04-01 20:20:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:24,026 INFO L495 AbstractCegarLoop]: Abstraction has 2383 states and 2587 transitions. [2023-04-01 20:20:24,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:20:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2587 transitions. [2023-04-01 20:20:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-04-01 20:20:24,029 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:24,029 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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] [2023-04-01 20:20:24,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:24,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:24,237 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:24,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1763444138, now seen corresponding path program 1 times [2023-04-01 20:20:24,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:24,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737613457] [2023-04-01 20:20:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-01 20:20:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-04-01 20:20:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-04-01 20:20:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 101 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 20:20:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737613457] [2023-04-01 20:20:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737613457] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866755989] [2023-04-01 20:20:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:24,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:24,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:24,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:24,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 20:20:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:24,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 20:20:24,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-01 20:20:24,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 113 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 20:20:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866755989] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:20:25,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:20:25,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2023-04-01 20:20:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378197375] [2023-04-01 20:20:25,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:20:25,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 20:20:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 20:20:25,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:20:25,107 INFO L87 Difference]: Start difference. First operand 2383 states and 2587 transitions. Second operand has 15 states, 15 states have (on average 14.6) internal successors, (219), 13 states have internal predecessors, (219), 6 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-04-01 20:20:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:27,619 INFO L93 Difference]: Finished difference Result 5066 states and 5527 transitions. [2023-04-01 20:20:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-04-01 20:20:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 14.6) internal successors, (219), 13 states have internal predecessors, (219), 6 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 176 [2023-04-01 20:20:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:27,625 INFO L225 Difference]: With dead ends: 5066 [2023-04-01 20:20:27,625 INFO L226 Difference]: Without dead ends: 2550 [2023-04-01 20:20:27,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=458, Invalid=2194, Unknown=0, NotChecked=0, Total=2652 [2023-04-01 20:20:27,629 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3607 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3613 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:27,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3613 Valid, 134 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-01 20:20:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2023-04-01 20:20:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2397. [2023-04-01 20:20:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2312 states have (on average 1.0540657439446366) internal successors, (2437), 2359 states have internal predecessors, (2437), 19 states have call successors, (19), 19 states have call predecessors, (19), 65 states have return successors, (109), 18 states have call predecessors, (109), 18 states have call successors, (109) [2023-04-01 20:20:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 2565 transitions. [2023-04-01 20:20:27,673 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 2565 transitions. Word has length 176 [2023-04-01 20:20:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:27,673 INFO L495 AbstractCegarLoop]: Abstraction has 2397 states and 2565 transitions. [2023-04-01 20:20:27,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.6) internal successors, (219), 13 states have internal predecessors, (219), 6 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-04-01 20:20:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2565 transitions. [2023-04-01 20:20:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-04-01 20:20:27,677 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:27,677 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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] [2023-04-01 20:20:27,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:27,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 20:20:27,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:27,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash -516081814, now seen corresponding path program 1 times [2023-04-01 20:20:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185199048] [2023-04-01 20:20:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:20:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 20:20:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-01 20:20:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-04-01 20:20:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-04-01 20:20:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-04-01 20:20:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 172 proven. 44 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-04-01 20:20:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:20:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185199048] [2023-04-01 20:20:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185199048] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:20:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505711614] [2023-04-01 20:20:28,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:28,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:20:28,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:20:28,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:20:28,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 20:20:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:20:28,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 20:20:28,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:20:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 218 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-04-01 20:20:28,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:20:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 176 proven. 44 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-04-01 20:20:28,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505711614] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:20:28,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:20:28,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2023-04-01 20:20:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866115691] [2023-04-01 20:20:28,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:20:28,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 20:20:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:20:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 20:20:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-04-01 20:20:28,990 INFO L87 Difference]: Start difference. First operand 2397 states and 2565 transitions. Second operand has 14 states, 14 states have (on average 20.142857142857142) internal successors, (282), 12 states have internal predecessors, (282), 6 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-01 20:20:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:20:30,888 INFO L93 Difference]: Finished difference Result 4949 states and 5318 transitions. [2023-04-01 20:20:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-01 20:20:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.142857142857142) internal successors, (282), 12 states have internal predecessors, (282), 6 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 223 [2023-04-01 20:20:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:20:30,894 INFO L225 Difference]: With dead ends: 4949 [2023-04-01 20:20:30,894 INFO L226 Difference]: Without dead ends: 2693 [2023-04-01 20:20:30,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 469 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 20:20:30,897 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2710 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2710 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:20:30,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2710 Valid, 102 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-01 20:20:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2023-04-01 20:20:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2534. [2023-04-01 20:20:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2446 states have (on average 1.0429272281275552) internal successors, (2551), 2494 states have internal predecessors, (2551), 20 states have call successors, (20), 20 states have call predecessors, (20), 67 states have return successors, (96), 19 states have call predecessors, (96), 19 states have call successors, (96) [2023-04-01 20:20:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 2667 transitions. [2023-04-01 20:20:30,942 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 2667 transitions. Word has length 223 [2023-04-01 20:20:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:20:30,943 INFO L495 AbstractCegarLoop]: Abstraction has 2534 states and 2667 transitions. [2023-04-01 20:20:30,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.142857142857142) internal successors, (282), 12 states have internal predecessors, (282), 6 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-04-01 20:20:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 2667 transitions. [2023-04-01 20:20:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-04-01 20:20:30,947 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:20:30,947 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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] [2023-04-01 20:20:30,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 20:20:31,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 20:20:31,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:20:31,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:20:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1835947262, now seen corresponding path program 1 times [2023-04-01 20:20:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:20:31,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615511858] [2023-04-01 20:20:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:20:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:20:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 20:20:31,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 20:20:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 20:20:31,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 20:20:31,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 20:20:31,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 20:20:31,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-01 20:20:31,289 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:20:31,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 20:20:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 08:20:31 BoogieIcfgContainer [2023-04-01 20:20:31,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 20:20:31,407 INFO L158 Benchmark]: Toolchain (without parser) took 23407.52ms. Allocated memory was 188.7MB in the beginning and 518.0MB in the end (delta: 329.3MB). Free memory was 140.4MB in the beginning and 324.9MB in the end (delta: -184.5MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2023-04-01 20:20:31,407 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 20:20:31,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.68ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 112.8MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-04-01 20:20:31,407 INFO L158 Benchmark]: Boogie Preprocessor took 70.96ms. Allocated memory is still 188.7MB. Free memory was 112.8MB in the beginning and 107.9MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-04-01 20:20:31,408 INFO L158 Benchmark]: RCFGBuilder took 851.04ms. Allocated memory was 188.7MB in the beginning and 298.8MB in the end (delta: 110.1MB). Free memory was 107.9MB in the beginning and 200.6MB in the end (delta: -92.8MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. [2023-04-01 20:20:31,408 INFO L158 Benchmark]: TraceAbstraction took 22131.26ms. Allocated memory was 298.8MB in the beginning and 518.0MB in the end (delta: 219.2MB). Free memory was 199.6MB in the beginning and 324.9MB in the end (delta: -125.4MB). Peak memory consumption was 94.3MB. Max. memory is 8.0GB. [2023-04-01 20:20:31,409 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.68ms. Allocated memory is still 188.7MB. Free memory was 140.4MB in the beginning and 112.8MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.96ms. Allocated memory is still 188.7MB. Free memory was 112.8MB in the beginning and 107.9MB in the end (delta: 5.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 851.04ms. Allocated memory was 188.7MB in the beginning and 298.8MB in the end (delta: 110.1MB). Free memory was 107.9MB in the beginning and 200.6MB in the end (delta: -92.8MB). Peak memory consumption was 19.2MB. Max. memory is 8.0GB. * TraceAbstraction took 22131.26ms. Allocated memory was 298.8MB in the beginning and 518.0MB in the end (delta: 219.2MB). Free memory was 199.6MB in the beginning and 324.9MB in the end (delta: -125.4MB). Peak memory consumption was 94.3MB. Max. memory is 8.0GB. * 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: 417]: 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 [\old(a)=57, \old(a12)=58, \old(a16)=56, \old(a17)=63, \old(a20)=50, \old(a21)=69, \old(a7)=62, \old(a8)=65, \old(b)=68, \old(c)=66, \old(d)=53, \old(e)=64, \old(f)=61, \old(u)=54, \old(v)=51, \old(w)=60, \old(x)=52, \old(y)=49, \old(z)=55, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, 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, output=-1, 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)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, 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, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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] [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, \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, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, 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, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L601] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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] [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \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, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, 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, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L601] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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] [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, 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 [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \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, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, 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=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L601] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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] [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, 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 [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, 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 [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, 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 [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, 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 [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, 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 [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, 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 [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, 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=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((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)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, \result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=3, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L601] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L113] a20 = 0 [L114] a8 = 15 [L115] a17 = 0 [L116] a21 = 1 [L117] return -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=3, \result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L601] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=3, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [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)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=5, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] CALL calculate_output(input) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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 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 [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L416] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] [L417] reach_error() VAL [\old(a16)=5, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=15, \old(input)=5, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 210 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14905 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14894 mSDsluCounter, 729 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 536 mSDsCounter, 2031 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13425 IncrementalHoareTripleChecker+Invalid, 15456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2031 mSolverCounterUnsat, 193 mSDtfsCounter, 13425 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2526 GetRequests, 2319 SyntacticMatches, 8 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3458occurred in iteration=5, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 3057 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2814 NumberOfCodeBlocks, 2814 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3517 ConstructedInterpolants, 0 QuantifiedInterpolants, 8278 SizeOfPredicates, 15 NumberOfNonLiveVariables, 4453 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 2137/2415 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! [2023-04-01 20:20:31,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...