./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebf0329a50f76ec68cef55e212088793910caa2b453acd0416a520032501892b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:40,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:40,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:51:40,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:40,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:40,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:40,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:40,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:40,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:40,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:40,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:40,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:40,549 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:40,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:40,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:51:40,551 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:40,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:40,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:40,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:40,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:51:40,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:40,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:51:40,555 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:40,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:51:40,556 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:40,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:40,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:40,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:40,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:40,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:40,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:40,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:51:40,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:51:40,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:51:40,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:40,561 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:51:40,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:40,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:40,563 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:40,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebf0329a50f76ec68cef55e212088793910caa2b453acd0416a520032501892b [2023-11-06 22:51:40,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:40,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:40,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:40,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:40,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:40,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2023-11-06 22:51:44,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:51:44,499 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:51:44,500 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/sv-benchmarks/c/eca-rers2012/Problem02_label59.c [2023-11-06 22:51:44,526 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/data/399b45c33/6cc42f7f93c74310ba5bc67204f23025/FLAGe3110e86f [2023-11-06 22:51:44,545 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/data/399b45c33/6cc42f7f93c74310ba5bc67204f23025 [2023-11-06 22:51:44,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:51:44,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:51:44,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:44,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:51:44,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:51:44,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:44" (1/1) ... [2023-11-06 22:51:44,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca8ba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:44, skipping insertion in model container [2023-11-06 22:51:44,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:44" (1/1) ... [2023-11-06 22:51:44,614 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:51:44,987 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/sv-benchmarks/c/eca-rers2012/Problem02_label59.c[14857,14870] [2023-11-06 22:51:45,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:45,056 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:51:45,179 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/sv-benchmarks/c/eca-rers2012/Problem02_label59.c[14857,14870] [2023-11-06 22:51:45,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:45,235 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:51:45,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45 WrapperNode [2023-11-06 22:51:45,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:45,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:45,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:51:45,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:51:45,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,352 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2023-11-06 22:51:45,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:45,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:51:45,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:51:45,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:51:45,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:51:45,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:51:45,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:51:45,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:51:45,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (1/1) ... [2023-11-06 22:51:45,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:45,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:45,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:51:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:51:45,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:51:45,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:51:45,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:51:45,667 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:51:45,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:51:46,948 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:51:46,960 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:51:46,960 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:51:46,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:46 BoogieIcfgContainer [2023-11-06 22:51:46,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:51:46,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:51:46,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:51:46,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:51:46,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:44" (1/3) ... [2023-11-06 22:51:46,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a5894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:46, skipping insertion in model container [2023-11-06 22:51:46,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:45" (2/3) ... [2023-11-06 22:51:46,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8a5894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:46, skipping insertion in model container [2023-11-06 22:51:46,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:46" (3/3) ... [2023-11-06 22:51:46,974 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label59.c [2023-11-06 22:51:46,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:51:46,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:51:47,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:51:47,074 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;@3985a733, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:51:47,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:51:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:51:47,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:47,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:47,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:47,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -742425229, now seen corresponding path program 1 times [2023-11-06 22:51:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541472111] [2023-11-06 22:51:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:47,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:47,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541472111] [2023-11-06 22:51:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541472111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:47,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712746896] [2023-11-06 22:51:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:47,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:47,803 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:48,918 INFO L93 Difference]: Finished difference Result 617 states and 1059 transitions. [2023-11-06 22:51:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2023-11-06 22:51:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:48,949 INFO L225 Difference]: With dead ends: 617 [2023-11-06 22:51:48,949 INFO L226 Difference]: Without dead ends: 316 [2023-11-06 22:51:48,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:48,966 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 118 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 102 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:51:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-06 22:51:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2023-11-06 22:51:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2023-11-06 22:51:49,059 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 83 [2023-11-06 22:51:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:49,062 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2023-11-06 22:51:49,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2023-11-06 22:51:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 22:51:49,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:49,074 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:51:49,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:49,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1514248782, now seen corresponding path program 1 times [2023-11-06 22:51:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:49,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102454629] [2023-11-06 22:51:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102454629] [2023-11-06 22:51:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102454629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731432134] [2023-11-06 22:51:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:49,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:49,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:49,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:49,309 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:49,976 INFO L93 Difference]: Finished difference Result 900 states and 1316 transitions. [2023-11-06 22:51:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-11-06 22:51:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:49,981 INFO L225 Difference]: With dead ends: 900 [2023-11-06 22:51:49,981 INFO L226 Difference]: Without dead ends: 593 [2023-11-06 22:51:49,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:49,986 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:49,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 117 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:51:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-11-06 22:51:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2023-11-06 22:51:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.2932203389830508) internal successors, (763), 590 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 763 transitions. [2023-11-06 22:51:50,033 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 763 transitions. Word has length 91 [2023-11-06 22:51:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:50,034 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 763 transitions. [2023-11-06 22:51:50,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 763 transitions. [2023-11-06 22:51:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:51:50,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:50,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:50,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:51:50,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:50,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1389241170, now seen corresponding path program 1 times [2023-11-06 22:51:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:50,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753386265] [2023-11-06 22:51:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:50,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753386265] [2023-11-06 22:51:50,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753386265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:50,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579812992] [2023-11-06 22:51:50,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:50,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:50,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:50,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:50,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:50,289 INFO L87 Difference]: Start difference. First operand 591 states and 763 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:50,950 INFO L93 Difference]: Finished difference Result 1465 states and 1942 transitions. [2023-11-06 22:51:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:50,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2023-11-06 22:51:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:50,957 INFO L225 Difference]: With dead ends: 1465 [2023-11-06 22:51:50,957 INFO L226 Difference]: Without dead ends: 876 [2023-11-06 22:51:50,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:50,960 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:50,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 272 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:51:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2023-11-06 22:51:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 874. [2023-11-06 22:51:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2268041237113403) internal successors, (1071), 873 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1071 transitions. [2023-11-06 22:51:50,990 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1071 transitions. Word has length 92 [2023-11-06 22:51:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:50,991 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1071 transitions. [2023-11-06 22:51:50,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1071 transitions. [2023-11-06 22:51:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 22:51:51,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:51,009 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:51,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:51:51,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:51,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1927193993, now seen corresponding path program 1 times [2023-11-06 22:51:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691747550] [2023-11-06 22:51:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691747550] [2023-11-06 22:51:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691747550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120346732] [2023-11-06 22:51:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:51,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:51,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:51,165 INFO L87 Difference]: Start difference. First operand 874 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:51,769 INFO L93 Difference]: Finished difference Result 2448 states and 3014 transitions. [2023-11-06 22:51:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:51,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-11-06 22:51:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:51,780 INFO L225 Difference]: With dead ends: 2448 [2023-11-06 22:51:51,780 INFO L226 Difference]: Without dead ends: 1576 [2023-11-06 22:51:51,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:51,784 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 190 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:51,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:51:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2023-11-06 22:51:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2023-11-06 22:51:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.193015873015873) internal successors, (1879), 1575 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1879 transitions. [2023-11-06 22:51:51,875 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1879 transitions. Word has length 93 [2023-11-06 22:51:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:51,875 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 1879 transitions. [2023-11-06 22:51:51,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1879 transitions. [2023-11-06 22:51:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 22:51:51,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:51,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:51,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:51:51,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:51,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:51,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1061675065, now seen corresponding path program 1 times [2023-11-06 22:51:51,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:51,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013573242] [2023-11-06 22:51:51,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:51:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:52,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013573242] [2023-11-06 22:51:52,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013573242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953565003] [2023-11-06 22:51:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:52,125 INFO L87 Difference]: Start difference. First operand 1576 states and 1879 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:52,669 INFO L93 Difference]: Finished difference Result 3571 states and 4339 transitions. [2023-11-06 22:51:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-11-06 22:51:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:52,681 INFO L225 Difference]: With dead ends: 3571 [2023-11-06 22:51:52,681 INFO L226 Difference]: Without dead ends: 1997 [2023-11-06 22:51:52,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:52,684 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:52,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 246 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2023-11-06 22:51:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2023-11-06 22:51:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1996 states have (on average 1.1773547094188377) internal successors, (2350), 1996 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2350 transitions. [2023-11-06 22:51:52,738 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2350 transitions. Word has length 96 [2023-11-06 22:51:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:52,738 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2350 transitions. [2023-11-06 22:51:52,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2350 transitions. [2023-11-06 22:51:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:51:52,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:52,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-06 22:51:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:51:52,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:52,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 514829366, now seen corresponding path program 1 times [2023-11-06 22:51:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333269216] [2023-11-06 22:51:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:52,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333269216] [2023-11-06 22:51:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333269216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:52,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917596456] [2023-11-06 22:51:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:52,886 INFO L87 Difference]: Start difference. First operand 1997 states and 2350 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:53,376 INFO L93 Difference]: Finished difference Result 3994 states and 4702 transitions. [2023-11-06 22:51:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2023-11-06 22:51:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:53,387 INFO L225 Difference]: With dead ends: 3994 [2023-11-06 22:51:53,388 INFO L226 Difference]: Without dead ends: 1717 [2023-11-06 22:51:53,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:53,397 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:53,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 61 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2023-11-06 22:51:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1715. [2023-11-06 22:51:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 1.132438739789965) internal successors, (1941), 1714 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1941 transitions. [2023-11-06 22:51:53,460 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1941 transitions. Word has length 112 [2023-11-06 22:51:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:53,462 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 1941 transitions. [2023-11-06 22:51:53,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1941 transitions. [2023-11-06 22:51:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:51:53,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:53,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2023-11-06 22:51:53,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:51:53,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:53,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 304876144, now seen corresponding path program 1 times [2023-11-06 22:51:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537586187] [2023-11-06 22:51:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537586187] [2023-11-06 22:51:53,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537586187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:53,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886692671] [2023-11-06 22:51:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:53,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:53,667 INFO L87 Difference]: Start difference. First operand 1715 states and 1941 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:54,232 INFO L93 Difference]: Finished difference Result 3989 states and 4586 transitions. [2023-11-06 22:51:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2023-11-06 22:51:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:54,247 INFO L225 Difference]: With dead ends: 3989 [2023-11-06 22:51:54,247 INFO L226 Difference]: Without dead ends: 2276 [2023-11-06 22:51:54,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:54,255 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 83 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:54,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 218 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2023-11-06 22:51:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2275. [2023-11-06 22:51:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2274 states have (on average 1.1350043975373791) internal successors, (2581), 2274 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2581 transitions. [2023-11-06 22:51:54,327 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2581 transitions. Word has length 113 [2023-11-06 22:51:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:54,328 INFO L495 AbstractCegarLoop]: Abstraction has 2275 states and 2581 transitions. [2023-11-06 22:51:54,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2581 transitions. [2023-11-06 22:51:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:51:54,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:54,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 22:51:54,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:51:54,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:54,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 155022592, now seen corresponding path program 1 times [2023-11-06 22:51:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489080363] [2023-11-06 22:51:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489080363] [2023-11-06 22:51:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489080363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:54,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923404678] [2023-11-06 22:51:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:54,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:54,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:54,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:54,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:51:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:51:54,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:51:55,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923404678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:55,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-06 22:51:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368899282] [2023-11-06 22:51:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:55,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:51:55,173 INFO L87 Difference]: Start difference. First operand 2275 states and 2581 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:55,758 INFO L93 Difference]: Finished difference Result 4265 states and 4834 transitions. [2023-11-06 22:51:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2023-11-06 22:51:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:55,771 INFO L225 Difference]: With dead ends: 4265 [2023-11-06 22:51:55,771 INFO L226 Difference]: Without dead ends: 1992 [2023-11-06 22:51:55,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:51:55,776 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 83 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:55,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 234 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2023-11-06 22:51:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1712. [2023-11-06 22:51:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1711 states have (on average 1.0970192869666862) internal successors, (1877), 1711 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 1877 transitions. [2023-11-06 22:51:55,832 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 1877 transitions. Word has length 116 [2023-11-06 22:51:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:55,833 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 1877 transitions. [2023-11-06 22:51:55,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 1877 transitions. [2023-11-06 22:51:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:51:55,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:55,837 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:51:55,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:51:56,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:56,044 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:56,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash -466961099, now seen corresponding path program 1 times [2023-11-06 22:51:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:56,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553702023] [2023-11-06 22:51:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:56,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553702023] [2023-11-06 22:51:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553702023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:56,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263999958] [2023-11-06 22:51:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:56,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:56,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:56,253 INFO L87 Difference]: Start difference. First operand 1712 states and 1877 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:56,607 INFO L93 Difference]: Finished difference Result 3131 states and 3431 transitions. [2023-11-06 22:51:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2023-11-06 22:51:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:56,619 INFO L225 Difference]: With dead ends: 3131 [2023-11-06 22:51:56,619 INFO L226 Difference]: Without dead ends: 1421 [2023-11-06 22:51:56,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:56,624 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:56,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 22 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2023-11-06 22:51:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2023-11-06 22:51:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.0746478873239436) internal successors, (1526), 1420 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1526 transitions. [2023-11-06 22:51:56,668 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1526 transitions. Word has length 116 [2023-11-06 22:51:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:56,668 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 1526 transitions. [2023-11-06 22:51:56,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1526 transitions. [2023-11-06 22:51:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:51:56,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:56,672 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:56,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:51:56,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:56,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1337196479, now seen corresponding path program 1 times [2023-11-06 22:51:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:56,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459909872] [2023-11-06 22:51:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:56,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 22:51:56,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:56,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459909872] [2023-11-06 22:51:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459909872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:56,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:56,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:56,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380185053] [2023-11-06 22:51:56,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:56,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:56,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:56,843 INFO L87 Difference]: Start difference. First operand 1421 states and 1526 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:57,280 INFO L93 Difference]: Finished difference Result 3260 states and 3499 transitions. [2023-11-06 22:51:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:57,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2023-11-06 22:51:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:57,287 INFO L225 Difference]: With dead ends: 3260 [2023-11-06 22:51:57,287 INFO L226 Difference]: Without dead ends: 1279 [2023-11-06 22:51:57,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:57,290 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 128 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:57,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 227 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2023-11-06 22:51:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2023-11-06 22:51:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.0610328638497653) internal successors, (1356), 1278 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1356 transitions. [2023-11-06 22:51:57,322 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1356 transitions. Word has length 126 [2023-11-06 22:51:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:57,322 INFO L495 AbstractCegarLoop]: Abstraction has 1279 states and 1356 transitions. [2023-11-06 22:51:57,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1356 transitions. [2023-11-06 22:51:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:51:57,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:57,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 22:51:57,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:51:57,326 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:57,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2031704263, now seen corresponding path program 1 times [2023-11-06 22:51:57,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896530061] [2023-11-06 22:51:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896530061] [2023-11-06 22:51:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896530061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133656377] [2023-11-06 22:51:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:57,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:57,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:57,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:57,491 INFO L87 Difference]: Start difference. First operand 1279 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:57,895 INFO L93 Difference]: Finished difference Result 2556 states and 2710 transitions. [2023-11-06 22:51:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2023-11-06 22:51:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:57,902 INFO L225 Difference]: With dead ends: 2556 [2023-11-06 22:51:57,903 INFO L226 Difference]: Without dead ends: 1279 [2023-11-06 22:51:57,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:57,905 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 81 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:57,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 175 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2023-11-06 22:51:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2023-11-06 22:51:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.0571205007824727) internal successors, (1351), 1278 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1351 transitions. [2023-11-06 22:51:57,940 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1351 transitions. Word has length 136 [2023-11-06 22:51:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:57,940 INFO L495 AbstractCegarLoop]: Abstraction has 1279 states and 1351 transitions. [2023-11-06 22:51:57,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1351 transitions. [2023-11-06 22:51:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:51:57,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:57,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:57,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:51:57,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:57,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:57,945 INFO L85 PathProgramCache]: Analyzing trace with hash 350454712, now seen corresponding path program 1 times [2023-11-06 22:51:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544322287] [2023-11-06 22:51:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 22:51:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544322287] [2023-11-06 22:51:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544322287] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119763637] [2023-11-06 22:51:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:58,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:58,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:58,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:51:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:58,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:51:58,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 22:51:58,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:58,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119763637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:58,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:58,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-11-06 22:51:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101311915] [2023-11-06 22:51:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:58,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:51:58,668 INFO L87 Difference]: Start difference. First operand 1279 states and 1351 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:59,135 INFO L93 Difference]: Finished difference Result 2976 states and 3135 transitions. [2023-11-06 22:51:59,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:59,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2023-11-06 22:51:59,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:59,144 INFO L225 Difference]: With dead ends: 2976 [2023-11-06 22:51:59,145 INFO L226 Difference]: Without dead ends: 1557 [2023-11-06 22:51:59,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:51:59,148 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 132 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:59,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 211 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2023-11-06 22:51:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1415. [2023-11-06 22:51:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1414 states have (on average 1.0424328147100423) internal successors, (1474), 1414 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1474 transitions. [2023-11-06 22:51:59,196 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1474 transitions. Word has length 144 [2023-11-06 22:51:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:59,196 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 1474 transitions. [2023-11-06 22:51:59,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1474 transitions. [2023-11-06 22:51:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-11-06 22:51:59,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:59,202 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:59,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:59,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:51:59,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:59,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2015111139, now seen corresponding path program 1 times [2023-11-06 22:51:59,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697975646] [2023-11-06 22:51:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-06 22:51:59,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697975646] [2023-11-06 22:51:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697975646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:59,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:59,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:59,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230588132] [2023-11-06 22:51:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:59,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:59,585 INFO L87 Difference]: Start difference. First operand 1415 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:52:00,019 INFO L93 Difference]: Finished difference Result 3107 states and 3233 transitions. [2023-11-06 22:52:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:52:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2023-11-06 22:52:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:52:00,028 INFO L225 Difference]: With dead ends: 3107 [2023-11-06 22:52:00,028 INFO L226 Difference]: Without dead ends: 1552 [2023-11-06 22:52:00,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:52:00,031 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:52:00,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 19 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:52:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-11-06 22:52:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1272. [2023-11-06 22:52:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 1.03933910306845) internal successors, (1321), 1271 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1321 transitions. [2023-11-06 22:52:00,068 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1321 transitions. Word has length 196 [2023-11-06 22:52:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:52:00,068 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1321 transitions. [2023-11-06 22:52:00,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:52:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1321 transitions. [2023-11-06 22:52:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-11-06 22:52:00,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:52:00,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:00,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:52:00,075 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:52:00,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:52:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1600594216, now seen corresponding path program 1 times [2023-11-06 22:52:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:52:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872652249] [2023-11-06 22:52:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:52:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:52:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:00,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:52:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:52:00,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:52:00,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:52:00,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:52:00,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:52:00,307 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:00,312 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:52:00,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:52:00 BoogieIcfgContainer [2023-11-06 22:52:00,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:52:00,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:52:00,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:52:00,492 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:52:00,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:46" (3/4) ... [2023-11-06 22:52:00,493 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:52:00,715 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:52:00,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:52:00,717 INFO L158 Benchmark]: Toolchain (without parser) took 16160.25ms. Allocated memory was 136.3MB in the beginning and 287.3MB in the end (delta: 151.0MB). Free memory was 99.5MB in the beginning and 245.9MB in the end (delta: -146.3MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,718 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 55.7MB in the beginning and 55.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:52:00,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.22ms. Allocated memory is still 136.3MB. Free memory was 99.1MB in the beginning and 72.8MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.87ms. Allocated memory is still 136.3MB. Free memory was 72.4MB in the beginning and 67.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,719 INFO L158 Benchmark]: Boogie Preprocessor took 96.38ms. Allocated memory is still 136.3MB. Free memory was 66.9MB in the beginning and 62.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,719 INFO L158 Benchmark]: RCFGBuilder took 1512.78ms. Allocated memory is still 136.3MB. Free memory was 62.6MB in the beginning and 79.9MB in the end (delta: -17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,720 INFO L158 Benchmark]: TraceAbstraction took 13525.25ms. Allocated memory was 136.3MB in the beginning and 239.1MB in the end (delta: 102.8MB). Free memory was 79.1MB in the beginning and 79.9MB in the end (delta: -717.8kB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,720 INFO L158 Benchmark]: Witness Printer took 224.54ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 79.9MB in the beginning and 245.9MB in the end (delta: -166.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-11-06 22:52:00,722 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 55.7MB in the beginning and 55.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.22ms. Allocated memory is still 136.3MB. Free memory was 99.1MB in the beginning and 72.8MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.87ms. Allocated memory is still 136.3MB. Free memory was 72.4MB in the beginning and 67.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.38ms. Allocated memory is still 136.3MB. Free memory was 66.9MB in the beginning and 62.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1512.78ms. Allocated memory is still 136.3MB. Free memory was 62.6MB in the beginning and 79.9MB in the end (delta: -17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13525.25ms. Allocated memory was 136.3MB in the beginning and 239.1MB in the end (delta: 102.8MB). Free memory was 79.1MB in the beginning and 79.9MB in the end (delta: -717.8kB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * Witness Printer took 224.54ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 79.9MB in the beginning and 245.9MB in the end (delta: -166.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 431]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\old(input)=4, \result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, output=23, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=3, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\old(input)=3, \result=25, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] EXPR input = __VERIFIER_nondet_int() [L621] COND FALSE, EXPR !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=5, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L165] a25 = 1 [L166] a19 = 1 [L167] a28 = 7 [L168] return -1; VAL [\old(input)=5, \result=-1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] EXPR output = calculate_output(input) [L617-L626] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L431] reach_error() VAL [\old(input)=4, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1564 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1564 mSDsluCounter, 1983 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4379 IncrementalHoareTripleChecker+Invalid, 5088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 709 mSolverCounterUnsat, 1804 mSDtfsCounter, 4379 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2275occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 716 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2005 NumberOfCodeBlocks, 2005 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1759 ConstructedInterpolants, 0 QuantifiedInterpolants, 4032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 751/767 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-11-06 22:52:00,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90951d07-b1b5-421a-82a1-113a59b80ac3/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE