/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/Problem10_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 22:14:51,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 22:14:51,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 22:14:51,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 22:14:51,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 22:14:51,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 22:14:51,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 22:14:51,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 22:14:51,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 22:14:51,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 22:14:51,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 22:14:51,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 22:14:51,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 22:14:51,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 22:14:51,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 22:14:51,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 22:14:51,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 22:14:51,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 22:14:51,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 22:14:51,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 22:14:51,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 22:14:51,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 22:14:51,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 22:14:51,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 22:14:51,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 22:14:51,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 22:14:51,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 22:14:51,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 22:14:51,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 22:14:51,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 22:14:51,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 22:14:51,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 22:14:51,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 22:14:51,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 22:14:51,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 22:14:51,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 22:14:51,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 22:14:51,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 22:14:51,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 22:14:51,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 22:14:51,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 22:14:51,974 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 22:14:51,998 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 22:14:51,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 22:14:51,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 22:14:51,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 22:14:51,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 22:14:51,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 22:14:52,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 22:14:52,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 22:14:52,000 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 22:14:52,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 22:14:52,000 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 22:14:52,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 22:14:52,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 22:14:52,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 22:14:52,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 22:14:52,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 22:14:52,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:14:52,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 22:14:52,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 22:14:52,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 22:14:52,003 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 22:14:52,003 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 22:14:52,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 22:14:52,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 22:14:52,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 22:14:52,275 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 22:14:52,275 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 22:14:52,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label48.c [2023-04-01 22:14:53,580 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 22:14:53,851 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 22:14:53,852 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label48.c [2023-04-01 22:14:53,863 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e89a4f14/e83d6311633340dbb4bff3ff3a48533a/FLAG5b346a678 [2023-04-01 22:14:53,881 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e89a4f14/e83d6311633340dbb4bff3ff3a48533a [2023-04-01 22:14:53,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 22:14:53,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 22:14:53,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 22:14:53,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 22:14:53,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 22:14:53,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:14:53" (1/1) ... [2023-04-01 22:14:53,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5f4f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:53, skipping insertion in model container [2023-04-01 22:14:53,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:14:53" (1/1) ... [2023-04-01 22:14:53,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 22:14:53,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 22:14:54,099 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/Problem10_label48.c[1104,1117] [2023-04-01 22:14:54,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:14:54,287 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 22:14:54,300 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/Problem10_label48.c[1104,1117] [2023-04-01 22:14:54,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:14:54,394 INFO L208 MainTranslator]: Completed translation [2023-04-01 22:14:54,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54 WrapperNode [2023-04-01 22:14:54,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 22:14:54,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 22:14:54,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 22:14:54,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 22:14:54,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,473 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 22:14:54,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 22:14:54,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 22:14:54,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 22:14:54,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (1/1) ... [2023-04-01 22:14:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:14:54,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:54,524 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 22:14:54,542 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 22:14:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 22:14:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 22:14:54,561 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 22:14:54,561 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-04-01 22:14:54,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 22:14:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-04-01 22:14:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 22:14:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 22:14:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 22:14:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 22:14:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 22:14:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 22:14:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 22:14:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 22:14:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 22:14:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 22:14:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 22:14:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 22:14:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 22:14:54,646 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 22:14:54,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 22:14:55,538 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 22:14:55,545 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 22:14:55,546 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 22:14:55,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:14:55 BoogieIcfgContainer [2023-04-01 22:14:55,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 22:14:55,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 22:14:55,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 22:14:55,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 22:14:55,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 10:14:53" (1/3) ... [2023-04-01 22:14:55,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d60e855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:14:55, skipping insertion in model container [2023-04-01 22:14:55,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:14:54" (2/3) ... [2023-04-01 22:14:55,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d60e855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:14:55, skipping insertion in model container [2023-04-01 22:14:55,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:14:55" (3/3) ... [2023-04-01 22:14:55,554 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label48.c [2023-04-01 22:14:55,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 22:14:55,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 22:14:55,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 22:14:55,628 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;@6f29cd11, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 22:14:55,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 22:14:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 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 22:14:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 22:14:55,639 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:55,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:14:55,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:55,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash -957010774, now seen corresponding path program 1 times [2023-04-01 22:14:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223498004] [2023-04-01 22:14:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:56,082 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 22:14:56,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223498004] [2023-04-01 22:14:56,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223498004] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:56,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:14:56,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 22:14:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674766859] [2023-04-01 22:14:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:56,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 22:14:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 22:14:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 22:14:56,161 INFO L87 Difference]: Start difference. First operand has 215 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 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 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 22:14:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:57,696 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2023-04-01 22:14:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 22:14:57,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2023-04-01 22:14:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:57,718 INFO L225 Difference]: With dead ends: 730 [2023-04-01 22:14:57,718 INFO L226 Difference]: Without dead ends: 447 [2023-04-01 22:14:57,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:14:57,730 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 693 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:57,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 38 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-01 22:14:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-04-01 22:14:57,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2023-04-01 22:14:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 429 states have (on average 1.5268065268065267) internal successors, (655), 431 states have internal predecessors, (655), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-04-01 22:14:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2023-04-01 22:14:57,811 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 13 [2023-04-01 22:14:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:57,812 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2023-04-01 22:14:57,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 22:14:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2023-04-01 22:14:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-04-01 22:14:57,815 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:57,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:14:57,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 22:14:57,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:57,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 370928415, now seen corresponding path program 1 times [2023-04-01 22:14:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801657683] [2023-04-01 22:14:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:58,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:58,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801657683] [2023-04-01 22:14:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801657683] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:58,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:14:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 22:14:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052991108] [2023-04-01 22:14:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:58,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 22:14:58,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 22:14:58,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 22:14:58,157 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand has 8 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:14:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:14:59,082 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2023-04-01 22:14:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 22:14:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2023-04-01 22:14:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:14:59,088 INFO L225 Difference]: With dead ends: 1041 [2023-04-01 22:14:59,089 INFO L226 Difference]: Without dead ends: 606 [2023-04-01 22:14:59,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:14:59,096 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 733 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 22:14:59,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 42 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 22:14:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-04-01 22:14:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2023-04-01 22:14:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 1.3937282229965158) internal successors, (800), 580 states have internal predecessors, (800), 6 states have call successors, (6), 6 states have call predecessors, (6), 11 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2023-04-01 22:14:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2023-04-01 22:14:59,140 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 86 [2023-04-01 22:14:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:14:59,166 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2023-04-01 22:14:59,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:14:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2023-04-01 22:14:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-01 22:14:59,171 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:14:59,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:14:59,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 22:14:59,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:14:59,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:14:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -125886005, now seen corresponding path program 1 times [2023-04-01 22:14:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:14:59,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334759869] [2023-04-01 22:14:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:14:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:14:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:14:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:14:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334759869] [2023-04-01 22:14:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334759869] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:14:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447025981] [2023-04-01 22:14:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:14:59,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:14:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:14:59,403 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 22:14:59,407 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 22:14:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:14:59,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:14:59,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:14:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:14:59,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:14:59,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447025981] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:14:59,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:14:59,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-04-01 22:14:59,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932577649] [2023-04-01 22:14:59,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:14:59,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:14:59,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:14:59,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:14:59,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:14:59,550 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:00,018 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2023-04-01 22:15:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2023-04-01 22:15:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:00,023 INFO L225 Difference]: With dead ends: 1615 [2023-04-01 22:15:00,024 INFO L226 Difference]: Without dead ends: 1029 [2023-04-01 22:15:00,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:15:00,030 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 156 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:00,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 57 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2023-04-01 22:15:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2023-04-01 22:15:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 860 states have (on average 1.2744186046511627) internal successors, (1096), 870 states have internal predecessors, (1096), 8 states have call successors, (8), 8 states have call predecessors, (8), 17 states have return successors, (46), 7 states have call predecessors, (46), 7 states have call successors, (46) [2023-04-01 22:15:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2023-04-01 22:15:00,070 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 92 [2023-04-01 22:15:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:00,071 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2023-04-01 22:15:00,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2023-04-01 22:15:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-04-01 22:15:00,082 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:00,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:00,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:00,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:00,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:00,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1694078774, now seen corresponding path program 1 times [2023-04-01 22:15:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:00,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138950494] [2023-04-01 22:15:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:00,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:00,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138950494] [2023-04-01 22:15:00,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138950494] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:00,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:00,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 22:15:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961719123] [2023-04-01 22:15:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:00,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 22:15:00,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:00,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 22:15:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:15:00,765 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 4 states have internal predecessors, (143), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:01,640 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2023-04-01 22:15:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 22:15:01,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 4 states have internal predecessors, (143), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 149 [2023-04-01 22:15:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:01,647 INFO L225 Difference]: With dead ends: 2245 [2023-04-01 22:15:01,647 INFO L226 Difference]: Without dead ends: 1365 [2023-04-01 22:15:01,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-04-01 22:15:01,650 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 747 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 52 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-01 22:15:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-04-01 22:15:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2023-04-01 22:15:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1015 states have (on average 1.2423645320197045) internal successors, (1261), 1039 states have internal predecessors, (1261), 9 states have call successors, (9), 9 states have call predecessors, (9), 32 states have return successors, (89), 8 states have call predecessors, (89), 8 states have call successors, (89) [2023-04-01 22:15:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1359 transitions. [2023-04-01 22:15:01,690 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1359 transitions. Word has length 149 [2023-04-01 22:15:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:01,691 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1359 transitions. [2023-04-01 22:15:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 4 states have internal predecessors, (143), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1359 transitions. [2023-04-01 22:15:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-04-01 22:15:01,693 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:01,693 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2023-04-01 22:15:01,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 22:15:01,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:01,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash 614747658, now seen corresponding path program 1 times [2023-04-01 22:15:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:01,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442348468] [2023-04-01 22:15:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:01,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-01 22:15:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:15:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442348468] [2023-04-01 22:15:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442348468] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935200694] [2023-04-01 22:15:02,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:02,013 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 22:15:02,041 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 22:15:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:02,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:02,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:02,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 80 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935200694] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:02,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2023-04-01 22:15:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832625542] [2023-04-01 22:15:02,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:02,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 22:15:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 22:15:02,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:02,611 INFO L87 Difference]: Start difference. First operand 1057 states and 1359 transitions. Second operand has 13 states, 13 states have (on average 26.692307692307693) internal successors, (347), 11 states have internal predecessors, (347), 5 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 22:15:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:04,228 INFO L93 Difference]: Finished difference Result 2877 states and 3891 transitions. [2023-04-01 22:15:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 22:15:04,229 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 26.692307692307693) internal successors, (347), 11 states have internal predecessors, (347), 5 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 173 [2023-04-01 22:15:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:04,238 INFO L225 Difference]: With dead ends: 2877 [2023-04-01 22:15:04,238 INFO L226 Difference]: Without dead ends: 1826 [2023-04-01 22:15:04,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2023-04-01 22:15:04,241 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1089 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:04,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 86 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-01 22:15:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2023-04-01 22:15:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1365. [2023-04-01 22:15:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1308 states have (on average 1.1964831804281346) internal successors, (1565), 1343 states have internal predecessors, (1565), 11 states have call successors, (11), 11 states have call predecessors, (11), 45 states have return successors, (131), 10 states have call predecessors, (131), 10 states have call successors, (131) [2023-04-01 22:15:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1707 transitions. [2023-04-01 22:15:04,286 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1707 transitions. Word has length 173 [2023-04-01 22:15:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:04,286 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1707 transitions. [2023-04-01 22:15:04,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.692307692307693) internal successors, (347), 11 states have internal predecessors, (347), 5 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-01 22:15:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1707 transitions. [2023-04-01 22:15:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-04-01 22:15:04,289 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:04,289 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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] [2023-04-01 22:15:04,299 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 22:15:04,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:04,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:04,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1289065345, now seen corresponding path program 1 times [2023-04-01 22:15:04,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:04,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723120773] [2023-04-01 22:15:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-04-01 22:15:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:15:05,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723120773] [2023-04-01 22:15:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723120773] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244402168] [2023-04-01 22:15:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:05,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:05,237 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 22:15:05,260 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 22:15:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:05,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:05,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-04-01 22:15:05,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:05,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244402168] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:05,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-04-01 22:15:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84048528] [2023-04-01 22:15:05,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:05,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:05,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-01 22:15:05,363 INFO L87 Difference]: Start difference. First operand 1365 states and 1707 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:05,758 INFO L93 Difference]: Finished difference Result 2724 states and 3414 transitions. [2023-04-01 22:15:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 190 [2023-04-01 22:15:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:05,764 INFO L225 Difference]: With dead ends: 2724 [2023-04-01 22:15:05,764 INFO L226 Difference]: Without dead ends: 1365 [2023-04-01 22:15:05,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-01 22:15:05,768 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 138 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:05,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 239 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-04-01 22:15:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1212. [2023-04-01 22:15:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1162 states have (on average 1.1471600688468158) internal successors, (1333), 1192 states have internal predecessors, (1333), 10 states have call successors, (10), 10 states have call predecessors, (10), 39 states have return successors, (87), 9 states have call predecessors, (87), 9 states have call successors, (87) [2023-04-01 22:15:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1430 transitions. [2023-04-01 22:15:05,801 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1430 transitions. Word has length 190 [2023-04-01 22:15:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:05,802 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 1430 transitions. [2023-04-01 22:15:05,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1430 transitions. [2023-04-01 22:15:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-04-01 22:15:05,805 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:05,805 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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 22:15:05,820 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 22:15:06,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:06,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:06,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:06,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1969826823, now seen corresponding path program 1 times [2023-04-01 22:15:06,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:06,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106650656] [2023-04-01 22:15:06,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-01 22:15:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:15:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106650656] [2023-04-01 22:15:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106650656] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887934199] [2023-04-01 22:15:06,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:06,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:06,701 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 22:15:06,703 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 22:15:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:06,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:06,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:07,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887934199] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:07,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2023-04-01 22:15:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23658020] [2023-04-01 22:15:07,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:07,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 22:15:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:07,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 22:15:07,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:07,459 INFO L87 Difference]: Start difference. First operand 1212 states and 1430 transitions. Second operand has 13 states, 13 states have (on average 37.84615384615385) internal successors, (492), 11 states have internal predecessors, (492), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 22:15:09,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:09,621 INFO L93 Difference]: Finished difference Result 2816 states and 3388 transitions. [2023-04-01 22:15:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-01 22:15:09,621 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 37.84615384615385) internal successors, (492), 11 states have internal predecessors, (492), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 226 [2023-04-01 22:15:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:09,629 INFO L225 Difference]: With dead ends: 2816 [2023-04-01 22:15:09,629 INFO L226 Difference]: Without dead ends: 1610 [2023-04-01 22:15:09,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2023-04-01 22:15:09,634 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1821 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1827 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:09,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1827 Valid, 103 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-04-01 22:15:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2023-04-01 22:15:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1502. [2023-04-01 22:15:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1446 states have (on average 1.11134163208852) internal successors, (1607), 1478 states have internal predecessors, (1607), 12 states have call successors, (12), 12 states have call predecessors, (12), 43 states have return successors, (88), 11 states have call predecessors, (88), 11 states have call successors, (88) [2023-04-01 22:15:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1707 transitions. [2023-04-01 22:15:09,708 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1707 transitions. Word has length 226 [2023-04-01 22:15:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:09,709 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 1707 transitions. [2023-04-01 22:15:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.84615384615385) internal successors, (492), 11 states have internal predecessors, (492), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 22:15:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1707 transitions. [2023-04-01 22:15:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-04-01 22:15:09,712 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:09,712 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:09,721 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 22:15:09,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:09,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:09,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1912249579, now seen corresponding path program 1 times [2023-04-01 22:15:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:09,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571622577] [2023-04-01 22:15:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-01 22:15:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:15:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571622577] [2023-04-01 22:15:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571622577] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032802555] [2023-04-01 22:15:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:10,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:10,439 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 22:15:10,442 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 22:15:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:10,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:10,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032802555] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:11,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2023-04-01 22:15:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828009796] [2023-04-01 22:15:11,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 22:15:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 22:15:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-04-01 22:15:11,161 INFO L87 Difference]: Start difference. First operand 1502 states and 1707 transitions. Second operand has 12 states, 12 states have (on average 41.0) internal successors, (492), 10 states have internal predecessors, (492), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 22:15:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:12,771 INFO L93 Difference]: Finished difference Result 4454 states and 5083 transitions. [2023-04-01 22:15:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 22:15:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 41.0) internal successors, (492), 10 states have internal predecessors, (492), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 228 [2023-04-01 22:15:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:12,781 INFO L225 Difference]: With dead ends: 4454 [2023-04-01 22:15:12,781 INFO L226 Difference]: Without dead ends: 1929 [2023-04-01 22:15:12,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 462 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-04-01 22:15:12,787 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1094 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:12,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 60 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-01 22:15:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2023-04-01 22:15:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1490. [2023-04-01 22:15:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1440 states have (on average 1.0875) internal successors, (1566), 1466 states have internal predecessors, (1566), 12 states have call successors, (12), 12 states have call predecessors, (12), 37 states have return successors, (75), 11 states have call predecessors, (75), 11 states have call successors, (75) [2023-04-01 22:15:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1653 transitions. [2023-04-01 22:15:12,830 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1653 transitions. Word has length 228 [2023-04-01 22:15:12,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:12,830 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 1653 transitions. [2023-04-01 22:15:12,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 41.0) internal successors, (492), 10 states have internal predecessors, (492), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 22:15:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1653 transitions. [2023-04-01 22:15:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-04-01 22:15:12,834 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:12,834 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 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, 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] [2023-04-01 22:15:12,843 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 22:15:13,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:13,041 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:13,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1749128435, now seen corresponding path program 1 times [2023-04-01 22:15:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:13,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652081754] [2023-04-01 22:15:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:15:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-04-01 22:15:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652081754] [2023-04-01 22:15:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652081754] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35540966] [2023-04-01 22:15:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:13,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:13,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:13,801 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 22:15:13,824 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 22:15:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:13,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-01 22:15:13,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-04-01 22:15:14,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35540966] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-04-01 22:15:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938219086] [2023-04-01 22:15:14,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:14,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:14,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:14,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-01 22:15:14,008 INFO L87 Difference]: Start difference. First operand 1490 states and 1653 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:14,397 INFO L93 Difference]: Finished difference Result 3407 states and 3826 transitions. [2023-04-01 22:15:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 264 [2023-04-01 22:15:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:14,403 INFO L225 Difference]: With dead ends: 3407 [2023-04-01 22:15:14,404 INFO L226 Difference]: Without dead ends: 1921 [2023-04-01 22:15:14,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-01 22:15:14,407 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 135 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:14,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 235 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2023-04-01 22:15:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2023-04-01 22:15:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1864 states have (on average 1.0777896995708154) internal successors, (2009), 1891 states have internal predecessors, (2009), 15 states have call successors, (15), 15 states have call predecessors, (15), 41 states have return successors, (91), 14 states have call predecessors, (91), 14 states have call successors, (91) [2023-04-01 22:15:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2115 transitions. [2023-04-01 22:15:14,456 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2115 transitions. Word has length 264 [2023-04-01 22:15:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:14,456 INFO L495 AbstractCegarLoop]: Abstraction has 1921 states and 2115 transitions. [2023-04-01 22:15:14,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2115 transitions. [2023-04-01 22:15:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-04-01 22:15:14,460 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:14,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:14,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-01 22:15:14,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:14,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:14,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1619662474, now seen corresponding path program 1 times [2023-04-01 22:15:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491107884] [2023-04-01 22:15:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:15:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-04-01 22:15:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 157 proven. 6 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-04-01 22:15:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:15,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491107884] [2023-04-01 22:15:15,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491107884] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:15,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418366764] [2023-04-01 22:15:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:15,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:15,751 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 22:15:15,753 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 22:15:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 22:15:15,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-04-01 22:15:16,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 164 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-04-01 22:15:17,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418366764] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:17,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2023-04-01 22:15:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838609697] [2023-04-01 22:15:17,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:17,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 22:15:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 22:15:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-04-01 22:15:17,324 INFO L87 Difference]: Start difference. First operand 1921 states and 2115 transitions. Second operand has 16 states, 16 states have (on average 28.5) internal successors, (456), 14 states have internal predecessors, (456), 6 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-04-01 22:15:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:20,341 INFO L93 Difference]: Finished difference Result 5751 states and 6623 transitions. [2023-04-01 22:15:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-01 22:15:20,342 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 28.5) internal successors, (456), 14 states have internal predecessors, (456), 6 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 273 [2023-04-01 22:15:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:20,353 INFO L225 Difference]: With dead ends: 5751 [2023-04-01 22:15:20,353 INFO L226 Difference]: Without dead ends: 3834 [2023-04-01 22:15:20,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=488, Invalid=1674, Unknown=0, NotChecked=0, Total=2162 [2023-04-01 22:15:20,358 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1301 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 3859 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 3859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:20,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 129 Invalid, 4313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 3859 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-04-01 22:15:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2023-04-01 22:15:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3673. [2023-04-01 22:15:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 3574 states have (on average 1.0716284275321768) internal successors, (3830), 3619 states have internal predecessors, (3830), 27 states have call successors, (27), 27 states have call predecessors, (27), 71 states have return successors, (210), 26 states have call predecessors, (210), 26 states have call successors, (210) [2023-04-01 22:15:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4067 transitions. [2023-04-01 22:15:20,451 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4067 transitions. Word has length 273 [2023-04-01 22:15:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:20,452 INFO L495 AbstractCegarLoop]: Abstraction has 3673 states and 4067 transitions. [2023-04-01 22:15:20,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 28.5) internal successors, (456), 14 states have internal predecessors, (456), 6 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-04-01 22:15:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4067 transitions. [2023-04-01 22:15:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-04-01 22:15:20,459 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:20,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-04-01 22:15:20,472 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 22:15:20,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:20,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:20,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1479871182, now seen corresponding path program 1 times [2023-04-01 22:15:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486137267] [2023-04-01 22:15:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:15:20,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 22:15:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:15:20,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 22:15:20,916 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 22:15:20,916 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 22:15:20,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-01 22:15:20,921 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:20,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 22:15:21,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 10:15:21 BoogieIcfgContainer [2023-04-01 22:15:21,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 22:15:21,034 INFO L158 Benchmark]: Toolchain (without parser) took 27146.44ms. Allocated memory was 288.4MB in the beginning and 656.4MB in the end (delta: 368.1MB). Free memory was 239.6MB in the beginning and 588.0MB in the end (delta: -348.4MB). Peak memory consumption was 383.5MB. Max. memory is 8.0GB. [2023-04-01 22:15:21,034 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 188.7MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 22:15:21,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.05ms. Allocated memory is still 288.4MB. Free memory was 239.1MB in the beginning and 211.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-04-01 22:15:21,035 INFO L158 Benchmark]: Boogie Preprocessor took 94.74ms. Allocated memory is still 288.4MB. Free memory was 211.8MB in the beginning and 207.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-04-01 22:15:21,035 INFO L158 Benchmark]: RCFGBuilder took 1056.88ms. Allocated memory is still 288.4MB. Free memory was 207.1MB in the beginning and 124.8MB in the end (delta: 82.3MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. [2023-04-01 22:15:21,035 INFO L158 Benchmark]: TraceAbstraction took 25484.23ms. Allocated memory was 288.4MB in the beginning and 656.4MB in the end (delta: 368.1MB). Free memory was 124.3MB in the beginning and 588.0MB in the end (delta: -463.8MB). Peak memory consumption was 268.1MB. Max. memory is 8.0GB. [2023-04-01 22:15:21,036 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.16ms. Allocated memory is still 188.7MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.05ms. Allocated memory is still 288.4MB. Free memory was 239.1MB in the beginning and 211.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 94.74ms. Allocated memory is still 288.4MB. Free memory was 211.8MB in the beginning and 207.1MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1056.88ms. Allocated memory is still 288.4MB. Free memory was 207.1MB in the beginning and 124.8MB in the end (delta: 82.3MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. * TraceAbstraction took 25484.23ms. Allocated memory was 288.4MB in the beginning and 656.4MB in the end (delta: 368.1MB). Free memory was 124.3MB in the beginning and 588.0MB in the end (delta: -463.8MB). Peak memory consumption was 268.1MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [\old(a1)=180, \old(a10)=177, \old(a12)=179, \old(a19)=173, \old(a4)=178, \old(inputB)=171, \old(inputC)=174, \old(inputD)=172, \old(inputE)=181, \old(inputF)=175, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L536] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L539] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L544] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, a10=0, a12=0, a19=9, a1=23, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L550] COND TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L551] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L552] a10 = 1 [L554] return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=25, a10=1, a12=0, a19=9, a1=169, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=9, a1=169, a4=14, calculate_output(input)=25, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, a10=1, a12=0, a19=9, a1=169, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND TRUE ((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))) [L371] a1 = ((((a1 - 46038) + -455425) * 10)/ 9) [L372] a19 = 10 [L374] return 24; VAL [\old(a1)=169, \old(a10)=1, \old(a19)=9, \old(input)=4, \result=24, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=10, a1=-556993, a4=14, calculate_output(input)=24, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=-556993, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND TRUE ((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))) [L236] a1 = (((((a1 - 0) * 9)/ 10) % 25)- -12) [L237] a10 = 2 [L238] a19 = 8 [L240] return -1; VAL [\old(a1)=-556993, \old(a10)=1, \old(a19)=10, \old(input)=5, \result=-1, a10=2, a12=0, a19=8, a1=-6, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=2, a12=0, a19=8, a1=-6, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=24] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=2, a12=0, a19=8, a1=-6, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL calculate_output(input) VAL [\old(a1)=-6, \old(a10)=2, \old(a19)=8, \old(input)=2, a10=2, a12=0, a19=8, a1=-6, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=-6, \old(a10)=2, \old(a19)=8, \old(input)=2, a10=2, a12=0, a19=8, a1=-6, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)) VAL [\old(a1)=-6, \old(a10)=2, \old(a19)=8, \old(input)=2, a10=2, a12=0, a19=8, a1=-6, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] reach_error() VAL [\old(a1)=-6, \old(a10)=2, \old(a19)=8, \old(input)=2, a10=2, a12=0, a19=8, a1=-6, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7913 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7907 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 434 mSDsCounter, 1913 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12977 IncrementalHoareTripleChecker+Invalid, 14890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1913 mSolverCounterUnsat, 607 mSDtfsCounter, 12977 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2595 GetRequests, 2419 SyntacticMatches, 4 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3673occurred in iteration=10, InterpolantAutomatonStates: 140, 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, 1793 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3465 NumberOfCodeBlocks, 3465 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4019 ConstructedInterpolants, 0 QuantifiedInterpolants, 14165 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2839 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 1774/1967 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 22:15:21,056 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...