/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:53:23,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:53:23,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:53:23,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:53:23,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:53:23,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:53:23,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:53:23,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:53:23,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:53:23,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:53:23,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:53:23,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:53:23,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:53:23,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:53:23,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:53:23,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:53:23,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:53:23,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:53:23,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:53:23,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:53:23,979 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:53:23,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:53:23,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:53:23,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:53:23,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:53:23,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:53:23,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:53:23,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:53:23,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:53:23,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:53:23,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:53:23,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:53:23,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:53:23,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:53:23,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:53:23,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:53:23,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:53:23,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:53:23,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:53:23,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:53:23,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:53:24,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:53:24,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-07 00:53:24,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:53:24,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:53:24,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:53:24,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:53:24,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:53:24,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:53:24,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:53:24,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:53:24,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:53:24,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:53:24,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:53:24,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:53:24,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:53:24,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:53:24,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:53:24,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:53:24,019 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 00:53:24,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:53:24,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:53:24,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:53:24,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:53:24,275 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:53:24,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-04-07 00:53:24,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bbb269a/268ca7da2d224c4ba570157d29f04944/FLAG96eeacee1 [2022-04-07 00:53:24,731 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:53:24,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-04-07 00:53:24,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bbb269a/268ca7da2d224c4ba570157d29f04944/FLAG96eeacee1 [2022-04-07 00:53:24,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bbb269a/268ca7da2d224c4ba570157d29f04944 [2022-04-07 00:53:24,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:53:24,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:53:24,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:53:24,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:53:24,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:53:24,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:24,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4713c7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24, skipping insertion in model container [2022-04-07 00:53:24,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:24,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:53:24,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:53:24,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-04-07 00:53:24,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:53:24,947 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:53:24,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-04-07 00:53:24,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:53:24,976 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:53:24,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24 WrapperNode [2022-04-07 00:53:24,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:53:24,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:53:24,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:53:24,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:53:24,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:24,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:24,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:24,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:24,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:25,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:25,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:25,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:53:25,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:53:25,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:53:25,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:53:25,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (1/1) ... [2022-04-07 00:53:25,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:53:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:53:25,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 00:53:25,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 00:53:25,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:53:25,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:53:25,070 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:53:25,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:53:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:53:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:53:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:53:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:53:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:53:25,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:53:25,168 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:53:25,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:53:25,407 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:53:25,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:53:25,413 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:53:25,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:53:25 BoogieIcfgContainer [2022-04-07 00:53:25,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:53:25,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:53:25,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:53:25,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:53:25,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:53:24" (1/3) ... [2022-04-07 00:53:25,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd0b447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:53:25, skipping insertion in model container [2022-04-07 00:53:25,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:53:24" (2/3) ... [2022-04-07 00:53:25,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd0b447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:53:25, skipping insertion in model container [2022-04-07 00:53:25,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:53:25" (3/3) ... [2022-04-07 00:53:25,428 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-04-07 00:53:25,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:53:25,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:53:25,477 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:53:25,488 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-07 00:53:25,489 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:53:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 00:53:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 00:53:25,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:25,521 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:25,522 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 1 times [2022-04-07 00:53:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:25,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291925569] [2022-04-07 00:53:25,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1605461033, now seen corresponding path program 2 times [2022-04-07 00:53:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:25,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301029951] [2022-04-07 00:53:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:25,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301029951] [2022-04-07 00:53:25,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301029951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:25,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:25,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:25,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:25,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291925569] [2022-04-07 00:53:25,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291925569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:25,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:25,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012603134] [2022-04-07 00:53:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:25,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:25,832 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:26,023 INFO L93 Difference]: Finished difference Result 82 states and 139 transitions. [2022-04-07 00:53:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 00:53:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:26,041 INFO L225 Difference]: With dead ends: 82 [2022-04-07 00:53:26,041 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 00:53:26,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:26,048 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:26,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 83 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 00:53:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2022-04-07 00:53:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2022-04-07 00:53:26,102 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2022-04-07 00:53:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:26,102 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2022-04-07 00:53:26,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2022-04-07 00:53:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 00:53:26,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:26,105 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:26,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:53:26,106 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 1 times [2022-04-07 00:53:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543113974] [2022-04-07 00:53:26,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295595, now seen corresponding path program 2 times [2022-04-07 00:53:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:26,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641582102] [2022-04-07 00:53:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:26,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641582102] [2022-04-07 00:53:26,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641582102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:26,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543113974] [2022-04-07 00:53:26,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543113974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934585320] [2022-04-07 00:53:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:26,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:26,220 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:26,359 INFO L93 Difference]: Finished difference Result 108 states and 193 transitions. [2022-04-07 00:53:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 00:53:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:26,362 INFO L225 Difference]: With dead ends: 108 [2022-04-07 00:53:26,362 INFO L226 Difference]: Without dead ends: 67 [2022-04-07 00:53:26,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:26,365 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:26,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 87 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-07 00:53:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-07 00:53:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-04-07 00:53:26,383 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2022-04-07 00:53:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:26,383 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-04-07 00:53:26,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-04-07 00:53:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 00:53:26,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:26,384 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:26,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:53:26,385 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:26,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 1 times [2022-04-07 00:53:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1630452915] [2022-04-07 00:53:26,386 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1770529236, now seen corresponding path program 2 times [2022-04-07 00:53:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:26,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804271556] [2022-04-07 00:53:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804271556] [2022-04-07 00:53:26,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804271556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:26,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1630452915] [2022-04-07 00:53:26,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1630452915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728610846] [2022-04-07 00:53:26,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:26,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:26,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:26,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:26,484 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:26,578 INFO L93 Difference]: Finished difference Result 100 states and 172 transitions. [2022-04-07 00:53:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 00:53:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:26,581 INFO L225 Difference]: With dead ends: 100 [2022-04-07 00:53:26,581 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 00:53:26,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:26,584 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:26,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 103 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 00:53:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-04-07 00:53:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2022-04-07 00:53:26,612 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2022-04-07 00:53:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:26,612 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2022-04-07 00:53:26,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2022-04-07 00:53:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 00:53:26,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:26,616 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:26,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:53:26,619 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 1 times [2022-04-07 00:53:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526709464] [2022-04-07 00:53:26,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1183723222, now seen corresponding path program 2 times [2022-04-07 00:53:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:26,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306912549] [2022-04-07 00:53:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:26,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306912549] [2022-04-07 00:53:26,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306912549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:26,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526709464] [2022-04-07 00:53:26,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526709464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497795068] [2022-04-07 00:53:26,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:26,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:26,688 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:26,791 INFO L93 Difference]: Finished difference Result 184 states and 324 transitions. [2022-04-07 00:53:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 00:53:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:26,794 INFO L225 Difference]: With dead ends: 184 [2022-04-07 00:53:26,794 INFO L226 Difference]: Without dead ends: 125 [2022-04-07 00:53:26,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:26,796 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:26,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-07 00:53:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-07 00:53:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2022-04-07 00:53:26,819 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2022-04-07 00:53:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:26,819 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2022-04-07 00:53:26,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2022-04-07 00:53:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 00:53:26,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:26,821 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:26,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:53:26,821 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 1 times [2022-04-07 00:53:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975677611] [2022-04-07 00:53:26,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash 925557784, now seen corresponding path program 2 times [2022-04-07 00:53:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:26,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133225915] [2022-04-07 00:53:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:26,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133225915] [2022-04-07 00:53:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133225915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:26,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975677611] [2022-04-07 00:53:26,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975677611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:26,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:26,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370085001] [2022-04-07 00:53:26,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:26,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:26,890 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:26,971 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2022-04-07 00:53:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 00:53:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:26,973 INFO L225 Difference]: With dead ends: 159 [2022-04-07 00:53:26,973 INFO L226 Difference]: Without dead ends: 157 [2022-04-07 00:53:26,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:26,974 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:26,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-07 00:53:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2022-04-07 00:53:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2022-04-07 00:53:26,988 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2022-04-07 00:53:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:26,988 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2022-04-07 00:53:26,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2022-04-07 00:53:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 00:53:26,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:26,989 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:26,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:53:26,989 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 1 times [2022-04-07 00:53:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:26,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476342384] [2022-04-07 00:53:26,991 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1959071734, now seen corresponding path program 2 times [2022-04-07 00:53:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:26,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190771602] [2022-04-07 00:53:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190771602] [2022-04-07 00:53:27,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190771602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:27,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476342384] [2022-04-07 00:53:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476342384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422582069] [2022-04-07 00:53:27,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:27,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:27,026 INFO L87 Difference]: Start difference. First operand 123 states and 211 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:27,114 INFO L93 Difference]: Finished difference Result 227 states and 395 transitions. [2022-04-07 00:53:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:27,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 00:53:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:27,116 INFO L225 Difference]: With dead ends: 227 [2022-04-07 00:53:27,116 INFO L226 Difference]: Without dead ends: 225 [2022-04-07 00:53:27,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:27,118 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:27,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-07 00:53:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2022-04-07 00:53:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2022-04-07 00:53:27,144 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2022-04-07 00:53:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:27,144 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2022-04-07 00:53:27,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2022-04-07 00:53:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 00:53:27,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:27,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:53:27,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:53:27,150 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 1 times [2022-04-07 00:53:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [67883017] [2022-04-07 00:53:27,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1700906296, now seen corresponding path program 2 times [2022-04-07 00:53:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:27,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013299677] [2022-04-07 00:53:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:27,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013299677] [2022-04-07 00:53:27,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013299677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:27,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [67883017] [2022-04-07 00:53:27,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [67883017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456659567] [2022-04-07 00:53:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:27,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:27,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:27,218 INFO L87 Difference]: Start difference. First operand 167 states and 285 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:27,314 INFO L93 Difference]: Finished difference Result 391 states and 675 transitions. [2022-04-07 00:53:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 00:53:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:27,316 INFO L225 Difference]: With dead ends: 391 [2022-04-07 00:53:27,316 INFO L226 Difference]: Without dead ends: 233 [2022-04-07 00:53:27,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:27,318 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:27,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 91 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-07 00:53:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-04-07 00:53:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2022-04-07 00:53:27,354 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2022-04-07 00:53:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:27,354 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2022-04-07 00:53:27,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2022-04-07 00:53:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 00:53:27,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:27,356 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:27,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:53:27,356 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 1 times [2022-04-07 00:53:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [925241744] [2022-04-07 00:53:27,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -601467221, now seen corresponding path program 2 times [2022-04-07 00:53:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:27,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066485820] [2022-04-07 00:53:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:27,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066485820] [2022-04-07 00:53:27,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066485820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:27,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [925241744] [2022-04-07 00:53:27,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [925241744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966617923] [2022-04-07 00:53:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:27,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:27,391 INFO L87 Difference]: Start difference. First operand 231 states and 391 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:27,494 INFO L93 Difference]: Finished difference Result 349 states and 589 transitions. [2022-04-07 00:53:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 00:53:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:27,496 INFO L225 Difference]: With dead ends: 349 [2022-04-07 00:53:27,496 INFO L226 Difference]: Without dead ends: 239 [2022-04-07 00:53:27,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:27,499 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:27,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-07 00:53:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2022-04-07 00:53:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2022-04-07 00:53:27,529 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2022-04-07 00:53:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:27,529 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2022-04-07 00:53:27,529 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2022-04-07 00:53:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 00:53:27,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:27,530 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:27,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:53:27,531 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 1 times [2022-04-07 00:53:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624140319] [2022-04-07 00:53:27,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1188273235, now seen corresponding path program 2 times [2022-04-07 00:53:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:27,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530942753] [2022-04-07 00:53:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:27,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530942753] [2022-04-07 00:53:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530942753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624140319] [2022-04-07 00:53:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624140319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124645587] [2022-04-07 00:53:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:27,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:27,563 INFO L87 Difference]: Start difference. First operand 237 states and 395 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:27,666 INFO L93 Difference]: Finished difference Result 429 states and 725 transitions. [2022-04-07 00:53:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:27,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 00:53:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:27,668 INFO L225 Difference]: With dead ends: 429 [2022-04-07 00:53:27,668 INFO L226 Difference]: Without dead ends: 427 [2022-04-07 00:53:27,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:27,669 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:27,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-07 00:53:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2022-04-07 00:53:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2022-04-07 00:53:27,704 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2022-04-07 00:53:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:27,704 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2022-04-07 00:53:27,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2022-04-07 00:53:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 00:53:27,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:27,706 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:27,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:53:27,706 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 1 times [2022-04-07 00:53:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990416855] [2022-04-07 00:53:27,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:27,707 INFO L85 PathProgramCache]: Analyzing trace with hash -930107797, now seen corresponding path program 2 times [2022-04-07 00:53:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:27,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288023599] [2022-04-07 00:53:27,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:27,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:27,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288023599] [2022-04-07 00:53:27,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288023599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:27,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1990416855] [2022-04-07 00:53:27,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1990416855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055472079] [2022-04-07 00:53:27,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:27,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:27,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:27,736 INFO L87 Difference]: Start difference. First operand 329 states and 539 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:27,848 INFO L93 Difference]: Finished difference Result 765 states and 1261 transitions. [2022-04-07 00:53:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 00:53:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:27,851 INFO L225 Difference]: With dead ends: 765 [2022-04-07 00:53:27,851 INFO L226 Difference]: Without dead ends: 451 [2022-04-07 00:53:27,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:27,854 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:27,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-07 00:53:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-04-07 00:53:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2022-04-07 00:53:27,908 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2022-04-07 00:53:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:27,908 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2022-04-07 00:53:27,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2022-04-07 00:53:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 00:53:27,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:27,909 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:27,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:53:27,910 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 1 times [2022-04-07 00:53:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408579566] [2022-04-07 00:53:27,911 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1818450109, now seen corresponding path program 2 times [2022-04-07 00:53:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:27,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043205187] [2022-04-07 00:53:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:27,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043205187] [2022-04-07 00:53:27,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043205187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:27,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408579566] [2022-04-07 00:53:27,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408579566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:27,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:27,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:27,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395266988] [2022-04-07 00:53:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:27,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:27,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:27,970 INFO L87 Difference]: Start difference. First operand 449 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:28,098 INFO L93 Difference]: Finished difference Result 673 states and 1085 transitions. [2022-04-07 00:53:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 00:53:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:28,101 INFO L225 Difference]: With dead ends: 673 [2022-04-07 00:53:28,101 INFO L226 Difference]: Without dead ends: 459 [2022-04-07 00:53:28,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:28,102 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:28,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 94 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-07 00:53:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2022-04-07 00:53:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2022-04-07 00:53:28,151 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2022-04-07 00:53:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:28,151 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2022-04-07 00:53:28,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2022-04-07 00:53:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 00:53:28,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:28,153 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:28,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:53:28,153 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 1 times [2022-04-07 00:53:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1982813848] [2022-04-07 00:53:28,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644095, now seen corresponding path program 2 times [2022-04-07 00:53:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:28,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006538378] [2022-04-07 00:53:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:28,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006538378] [2022-04-07 00:53:28,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006538378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:28,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1982813848] [2022-04-07 00:53:28,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1982813848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186595674] [2022-04-07 00:53:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:28,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:28,183 INFO L87 Difference]: Start difference. First operand 457 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:28,321 INFO L93 Difference]: Finished difference Result 813 states and 1313 transitions. [2022-04-07 00:53:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 00:53:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:28,325 INFO L225 Difference]: With dead ends: 813 [2022-04-07 00:53:28,325 INFO L226 Difference]: Without dead ends: 811 [2022-04-07 00:53:28,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:28,327 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:28,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 68 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-04-07 00:53:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2022-04-07 00:53:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2022-04-07 00:53:28,408 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2022-04-07 00:53:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:28,409 INFO L478 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2022-04-07 00:53:28,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2022-04-07 00:53:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 00:53:28,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:28,410 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:28,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 00:53:28,410 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 1 times [2022-04-07 00:53:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038261990] [2022-04-07 00:53:28,412 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1489809533, now seen corresponding path program 2 times [2022-04-07 00:53:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:28,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782808268] [2022-04-07 00:53:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782808268] [2022-04-07 00:53:28,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782808268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:28,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038261990] [2022-04-07 00:53:28,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038261990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996588963] [2022-04-07 00:53:28,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:28,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:28,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:28,448 INFO L87 Difference]: Start difference. First operand 649 states and 1007 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:28,588 INFO L93 Difference]: Finished difference Result 1501 states and 2337 transitions. [2022-04-07 00:53:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:28,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 00:53:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:28,592 INFO L225 Difference]: With dead ends: 1501 [2022-04-07 00:53:28,593 INFO L226 Difference]: Without dead ends: 875 [2022-04-07 00:53:28,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:28,595 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:28,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 95 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-04-07 00:53:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2022-04-07 00:53:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2022-04-07 00:53:28,685 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2022-04-07 00:53:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:28,685 INFO L478 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2022-04-07 00:53:28,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2022-04-07 00:53:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 00:53:28,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:28,687 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:28,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 00:53:28,687 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 1 times [2022-04-07 00:53:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193870382] [2022-04-07 00:53:28,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash -473523648, now seen corresponding path program 2 times [2022-04-07 00:53:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:28,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374470381] [2022-04-07 00:53:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:28,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374470381] [2022-04-07 00:53:28,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374470381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193870382] [2022-04-07 00:53:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193870382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112799108] [2022-04-07 00:53:28,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:28,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:28,742 INFO L87 Difference]: Start difference. First operand 873 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:28,887 INFO L93 Difference]: Finished difference Result 1309 states and 1993 transitions. [2022-04-07 00:53:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 00:53:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:28,892 INFO L225 Difference]: With dead ends: 1309 [2022-04-07 00:53:28,892 INFO L226 Difference]: Without dead ends: 891 [2022-04-07 00:53:28,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:28,894 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 114 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:28,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 91 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-04-07 00:53:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2022-04-07 00:53:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2022-04-07 00:53:28,966 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2022-04-07 00:53:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:28,966 INFO L478 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2022-04-07 00:53:28,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2022-04-07 00:53:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 00:53:28,968 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:28,968 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:28,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 00:53:28,969 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 1 times [2022-04-07 00:53:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181468583] [2022-04-07 00:53:28,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1060329662, now seen corresponding path program 2 times [2022-04-07 00:53:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:28,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682551873] [2022-04-07 00:53:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:28,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682551873] [2022-04-07 00:53:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682551873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181468583] [2022-04-07 00:53:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181468583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:28,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618771582] [2022-04-07 00:53:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:28,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:28,997 INFO L87 Difference]: Start difference. First operand 889 states and 1335 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:29,199 INFO L93 Difference]: Finished difference Result 1549 states and 2361 transitions. [2022-04-07 00:53:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 00:53:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:29,205 INFO L225 Difference]: With dead ends: 1549 [2022-04-07 00:53:29,206 INFO L226 Difference]: Without dead ends: 1547 [2022-04-07 00:53:29,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:29,207 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:29,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-07 00:53:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2022-04-07 00:53:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2022-04-07 00:53:29,327 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2022-04-07 00:53:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:29,327 INFO L478 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2022-04-07 00:53:29,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2022-04-07 00:53:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 00:53:29,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:29,330 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:29,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:53:29,330 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 1 times [2022-04-07 00:53:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:29,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957810180] [2022-04-07 00:53:29,331 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -802164224, now seen corresponding path program 2 times [2022-04-07 00:53:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:29,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406830152] [2022-04-07 00:53:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406830152] [2022-04-07 00:53:29,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406830152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:29,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:29,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:29,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957810180] [2022-04-07 00:53:29,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957810180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:29,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:29,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636384361] [2022-04-07 00:53:29,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:29,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:29,359 INFO L87 Difference]: Start difference. First operand 1289 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:29,604 INFO L93 Difference]: Finished difference Result 2957 states and 4313 transitions. [2022-04-07 00:53:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:29,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-07 00:53:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:29,612 INFO L225 Difference]: With dead ends: 2957 [2022-04-07 00:53:29,612 INFO L226 Difference]: Without dead ends: 1707 [2022-04-07 00:53:29,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:29,616 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:29,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-07 00:53:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2022-04-07 00:53:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2022-04-07 00:53:29,822 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2022-04-07 00:53:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:29,823 INFO L478 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2022-04-07 00:53:29,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2022-04-07 00:53:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 00:53:29,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:29,825 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:29,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:53:29,826 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 1 times [2022-04-07 00:53:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:29,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083354320] [2022-04-07 00:53:29,827 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1489734258, now seen corresponding path program 2 times [2022-04-07 00:53:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:29,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483427019] [2022-04-07 00:53:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:29,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483427019] [2022-04-07 00:53:29,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483427019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:29,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:29,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:29,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:29,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083354320] [2022-04-07 00:53:29,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083354320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:29,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:29,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931830394] [2022-04-07 00:53:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:29,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:29,857 INFO L87 Difference]: Start difference. First operand 1705 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:30,115 INFO L93 Difference]: Finished difference Result 2557 states and 3641 transitions. [2022-04-07 00:53:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 00:53:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:30,122 INFO L225 Difference]: With dead ends: 2557 [2022-04-07 00:53:30,122 INFO L226 Difference]: Without dead ends: 1739 [2022-04-07 00:53:30,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:30,128 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:30,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-07 00:53:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2022-04-07 00:53:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2022-04-07 00:53:30,312 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2022-04-07 00:53:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:30,312 INFO L478 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2022-04-07 00:53:30,313 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2022-04-07 00:53:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 00:53:30,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:30,315 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:30,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-07 00:53:30,315 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 1 times [2022-04-07 00:53:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:30,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261796370] [2022-04-07 00:53:30,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash 902928244, now seen corresponding path program 2 times [2022-04-07 00:53:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090508154] [2022-04-07 00:53:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090508154] [2022-04-07 00:53:30,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090508154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:30,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:30,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:30,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261796370] [2022-04-07 00:53:30,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261796370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:30,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:30,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978896870] [2022-04-07 00:53:30,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:30,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:30,348 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:30,678 INFO L93 Difference]: Finished difference Result 2957 states and 4201 transitions. [2022-04-07 00:53:30,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:30,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 00:53:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:30,690 INFO L225 Difference]: With dead ends: 2957 [2022-04-07 00:53:30,690 INFO L226 Difference]: Without dead ends: 2955 [2022-04-07 00:53:30,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:30,692 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:30,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-07 00:53:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2022-04-07 00:53:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2022-04-07 00:53:30,966 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2022-04-07 00:53:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:30,966 INFO L478 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2022-04-07 00:53:30,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2022-04-07 00:53:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 00:53:30,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:30,970 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:30,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-07 00:53:30,971 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 1 times [2022-04-07 00:53:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:30,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461675635] [2022-04-07 00:53:30,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1161093682, now seen corresponding path program 2 times [2022-04-07 00:53:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:30,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285709055] [2022-04-07 00:53:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:30,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:31,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:31,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285709055] [2022-04-07 00:53:31,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285709055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:31,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:31,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:31,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:31,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461675635] [2022-04-07 00:53:31,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461675635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:31,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:31,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620528895] [2022-04-07 00:53:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:31,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:31,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:31,004 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:31,403 INFO L93 Difference]: Finished difference Result 5837 states and 7913 transitions. [2022-04-07 00:53:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 00:53:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:31,417 INFO L225 Difference]: With dead ends: 5837 [2022-04-07 00:53:31,417 INFO L226 Difference]: Without dead ends: 3339 [2022-04-07 00:53:31,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:31,425 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:31,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-07 00:53:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2022-04-07 00:53:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2022-04-07 00:53:31,834 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2022-04-07 00:53:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:31,834 INFO L478 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2022-04-07 00:53:31,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2022-04-07 00:53:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 00:53:31,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:31,839 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:31,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 00:53:31,840 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 1 times [2022-04-07 00:53:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:31,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397412838] [2022-04-07 00:53:31,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2073779755, now seen corresponding path program 2 times [2022-04-07 00:53:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:31,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695242954] [2022-04-07 00:53:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:31,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695242954] [2022-04-07 00:53:31,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695242954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:31,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:31,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:31,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:31,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397412838] [2022-04-07 00:53:31,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397412838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:31,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:31,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925667458] [2022-04-07 00:53:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:31,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:31,869 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:32,174 INFO L93 Difference]: Finished difference Result 5005 states and 6601 transitions. [2022-04-07 00:53:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 00:53:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:32,187 INFO L225 Difference]: With dead ends: 5005 [2022-04-07 00:53:32,188 INFO L226 Difference]: Without dead ends: 3403 [2022-04-07 00:53:32,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:32,193 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:32,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-04-07 00:53:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2022-04-07 00:53:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2022-04-07 00:53:32,515 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2022-04-07 00:53:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:32,515 INFO L478 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2022-04-07 00:53:32,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2022-04-07 00:53:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 00:53:32,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:32,520 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:32,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 00:53:32,521 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 1 times [2022-04-07 00:53:32,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:32,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708343616] [2022-04-07 00:53:32,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:32,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1634381527, now seen corresponding path program 2 times [2022-04-07 00:53:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:32,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739922964] [2022-04-07 00:53:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:32,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:32,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739922964] [2022-04-07 00:53:32,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739922964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:32,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:32,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:32,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:32,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708343616] [2022-04-07 00:53:32,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708343616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:32,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:32,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624743859] [2022-04-07 00:53:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:32,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:32,572 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:33,054 INFO L93 Difference]: Finished difference Result 5645 states and 7369 transitions. [2022-04-07 00:53:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:33,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 00:53:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:33,078 INFO L225 Difference]: With dead ends: 5645 [2022-04-07 00:53:33,079 INFO L226 Difference]: Without dead ends: 5643 [2022-04-07 00:53:33,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:33,083 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:33,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2022-04-07 00:53:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2022-04-07 00:53:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2022-04-07 00:53:33,678 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2022-04-07 00:53:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:33,678 INFO L478 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2022-04-07 00:53:33,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2022-04-07 00:53:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 00:53:33,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:33,687 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:33,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 00:53:33,687 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:33,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 1 times [2022-04-07 00:53:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:33,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310434170] [2022-04-07 00:53:33,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1892546965, now seen corresponding path program 2 times [2022-04-07 00:53:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:33,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495983570] [2022-04-07 00:53:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495983570] [2022-04-07 00:53:33,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495983570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:33,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:33,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:33,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310434170] [2022-04-07 00:53:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310434170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:33,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:33,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847373974] [2022-04-07 00:53:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:33,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:33,713 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:34,242 INFO L93 Difference]: Finished difference Result 11533 states and 14409 transitions. [2022-04-07 00:53:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:34,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-07 00:53:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:34,258 INFO L225 Difference]: With dead ends: 11533 [2022-04-07 00:53:34,258 INFO L226 Difference]: Without dead ends: 6539 [2022-04-07 00:53:34,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:34,271 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:34,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:34,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2022-04-07 00:53:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2022-04-07 00:53:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2022-04-07 00:53:34,769 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2022-04-07 00:53:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:34,769 INFO L478 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2022-04-07 00:53:34,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2022-04-07 00:53:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 00:53:34,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:34,777 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:34,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-07 00:53:34,778 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 1 times [2022-04-07 00:53:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691461865] [2022-04-07 00:53:34,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -873564121, now seen corresponding path program 2 times [2022-04-07 00:53:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:34,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262430473] [2022-04-07 00:53:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:34,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:34,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262430473] [2022-04-07 00:53:34,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262430473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:34,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:34,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:34,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:34,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691461865] [2022-04-07 00:53:34,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691461865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:34,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:34,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022975672] [2022-04-07 00:53:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:34,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:34,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:34,812 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:35,332 INFO L93 Difference]: Finished difference Result 9805 states and 11849 transitions. [2022-04-07 00:53:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-07 00:53:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:35,344 INFO L225 Difference]: With dead ends: 9805 [2022-04-07 00:53:35,344 INFO L226 Difference]: Without dead ends: 6667 [2022-04-07 00:53:35,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:35,354 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:35,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2022-04-07 00:53:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2022-04-07 00:53:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2022-04-07 00:53:35,954 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2022-04-07 00:53:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:35,954 INFO L478 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2022-04-07 00:53:35,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2022-04-07 00:53:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 00:53:35,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:35,962 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:35,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-07 00:53:35,964 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 1 times [2022-04-07 00:53:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:35,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569276919] [2022-04-07 00:53:35,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1460370135, now seen corresponding path program 2 times [2022-04-07 00:53:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:35,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380983202] [2022-04-07 00:53:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:36,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:36,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380983202] [2022-04-07 00:53:36,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380983202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:36,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:36,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:36,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:36,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569276919] [2022-04-07 00:53:36,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569276919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:36,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:36,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453538001] [2022-04-07 00:53:36,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:36,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:36,004 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:36,994 INFO L93 Difference]: Finished difference Result 10763 states and 12680 transitions. [2022-04-07 00:53:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-07 00:53:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:37,015 INFO L225 Difference]: With dead ends: 10763 [2022-04-07 00:53:37,015 INFO L226 Difference]: Without dead ends: 10761 [2022-04-07 00:53:37,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:37,020 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:37,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:53:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2022-04-07 00:53:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2022-04-07 00:53:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2022-04-07 00:53:37,947 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2022-04-07 00:53:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:37,947 INFO L478 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2022-04-07 00:53:37,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2022-04-07 00:53:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 00:53:37,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:53:37,962 INFO L499 BasicCegarLoop]: 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] [2022-04-07 00:53:37,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-07 00:53:37,963 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:53:37,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:53:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 1 times [2022-04-07 00:53:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:37,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911699375] [2022-04-07 00:53:37,967 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:53:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1202204697, now seen corresponding path program 2 times [2022-04-07 00:53:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:53:37,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910840445] [2022-04-07 00:53:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:53:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:53:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:38,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:53:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:53:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:53:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:53:38,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910840445] [2022-04-07 00:53:38,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910840445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:38,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:38,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:38,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:53:38,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911699375] [2022-04-07 00:53:38,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911699375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:53:38,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:53:38,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:53:38,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34695246] [2022-04-07 00:53:38,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:53:38,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:53:38,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:53:38,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:53:38,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:53:38,009 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:53:39,070 INFO L93 Difference]: Finished difference Result 22793 states and 25991 transitions. [2022-04-07 00:53:39,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:53:39,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-07 00:53:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:53:39,071 INFO L225 Difference]: With dead ends: 22793 [2022-04-07 00:53:39,071 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:53:39,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:53:39,116 INFO L913 BasicCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:53:39,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 102 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:53:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:53:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:53:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-07 00:53:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:53:39,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-07 00:53:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:53:39,117 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:53:39,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:53:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:53:39,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:53:39,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:53:39,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-07 00:53:39,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:53:49,798 WARN L232 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 573 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:53:56,896 WARN L232 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 688 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:54:54,705 WARN L232 SmtUtils]: Spent 38.41s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:55:34,586 WARN L232 SmtUtils]: Spent 36.10s on a formula simplification that was a NOOP. DAG size: 2098 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:55:54,460 WARN L232 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 1071 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:56:12,214 WARN L232 SmtUtils]: Spent 14.87s on a formula simplification that was a NOOP. DAG size: 657 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:56:39,398 WARN L232 SmtUtils]: Spent 27.18s on a formula simplification that was a NOOP. DAG size: 1329 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:56:55,096 WARN L232 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 609 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:57:08,977 WARN L232 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:57:15,071 WARN L232 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 689 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:57:36,994 WARN L232 SmtUtils]: Spent 17.83s on a formula simplification that was a NOOP. DAG size: 753 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:57:58,542 WARN L232 SmtUtils]: Spent 21.55s on a formula simplification that was a NOOP. DAG size: 945 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:58:08,306 WARN L232 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 585 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-07 00:58:14,184 WARN L232 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 298 DAG size of output: 161 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:58:24,212 WARN L232 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 562 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:58:36,744 WARN L232 SmtUtils]: Spent 12.52s on a formula simplification. DAG size of input: 682 DAG size of output: 159 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:58:48,984 WARN L232 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 582 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:58:54,680 WARN L232 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 548 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:03,226 WARN L232 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 616 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:09,050 WARN L232 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 554 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:14,516 WARN L232 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 543 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:22,834 WARN L232 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 564 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:28,789 WARN L232 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 1056 DAG size of output: 3 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:35,001 WARN L232 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 642 DAG size of output: 35 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:45,649 WARN L232 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 1314 DAG size of output: 7 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 00:59:59,976 WARN L232 SmtUtils]: Spent 11.93s on a formula simplification. DAG size of input: 302 DAG size of output: 296 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:00:06,663 WARN L232 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 594 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:00:43,344 WARN L232 SmtUtils]: Spent 34.56s on a formula simplification. DAG size of input: 558 DAG size of output: 551 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:01:00,339 WARN L232 SmtUtils]: Spent 16.98s on a formula simplification. DAG size of input: 556 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:01:19,270 WARN L232 SmtUtils]: Spent 15.76s on a formula simplification. DAG size of input: 556 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:01:25,749 WARN L232 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 738 DAG size of output: 23 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:01:33,095 WARN L232 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 930 DAG size of output: 15 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:01:40,919 WARN L232 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 570 DAG size of output: 91 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 01:01:40,923 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-07 01:01:40,923 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-07 01:01:40,923 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-07 01:01:40,923 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 01:01:40,923 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 01:01:40,924 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 01:01:40,924 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 01:01:40,924 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 01:01:40,924 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 01:01:40,924 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 01:01:40,924 INFO L878 garLoopResultBuilder]: At program point L126-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk9~0 1)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p9~0 0)) (.cse3 (= main_~p7~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse3) (and .cse0 .cse4 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse5 .cse3))) [2022-04-07 01:01:40,924 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 151) the Hoare annotation is: true [2022-04-07 01:01:40,926 INFO L878 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse16 (= main_~p6~0 0)) (.cse11 (= main_~p9~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse17 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse10 (= main_~lk8~0 1)) (.cse15 (= main_~p2~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse12 (= main_~p7~0 0)) (.cse13 (= main_~p5~0 0)) (.cse7 (= main_~lk9~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse14 (= main_~p3~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse16) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse15 .cse7 .cse8) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse15 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse16 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse16 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse13 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse15 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse16 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse8 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse6 .cse12 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse8 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse15 .cse8 .cse14) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse15 .cse8) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse15 .cse7 .cse16) (and .cse2 .cse3 .cse10 .cse5 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse15 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse10 .cse6 .cse13 .cse15 .cse7 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse16 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse13 .cse15 .cse8 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse12 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse15 .cse16 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse15 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse15 .cse8 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse6 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse15 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse5 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse14 .cse9) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse15 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse13 .cse8 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse7 .cse16 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse13 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse10 .cse5 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse7 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse6 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse7 .cse16 .cse14 .cse9) (and .cse2 .cse3 .cse10 .cse11 .cse5 .cse12 .cse13 .cse15 .cse16 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13 .cse15 .cse7 .cse8) (and .cse0 .cse17 .cse2 .cse3 .cse4 .cse11 .cse6 .cse13 .cse15 .cse16) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse15 .cse16 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse7 .cse8 .cse14) (and .cse17 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse15 .cse7 .cse16 .cse14) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse16 .cse14 .cse9) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse7 .cse16 .cse14 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse5 .cse13 .cse16 .cse14 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse12 .cse8 .cse9) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse12 .cse15 .cse7 .cse8 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse7 .cse8 .cse14 .cse9))) [2022-04-07 01:01:40,926 INFO L878 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: (let ((.cse0 (= main_~lk8~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse1 (= main_~p9~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse6 (= main_~lk9~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse4) (and .cse5 .cse7 .cse6 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse5 .cse7 .cse1 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse2 .cse6 .cse3 .cse4))) [2022-04-07 01:01:40,926 INFO L878 garLoopResultBuilder]: At program point L111-1(lines 38 146) the Hoare annotation is: (let ((.cse8 (= main_~lk9~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse11 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p4~0 0)) (.cse10 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~p9~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse9 .cse10 .cse6 .cse8 .cse11) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse11) (and .cse9 .cse10 .cse6 .cse2 .cse7 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse5) (and .cse9 .cse10 .cse1 .cse2 .cse7 .cse5) (and .cse0 .cse9 .cse10 .cse6 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse11) (and .cse9 .cse1 .cse2 .cse7 .cse4 .cse11) (and .cse10 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse11) (and .cse10 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse1 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse4 .cse8 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse4 .cse11) (and .cse9 .cse1 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11) (and .cse10 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse6 .cse4 .cse8 .cse5) (and .cse9 .cse6 .cse7 .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse11) (and .cse10 .cse6 .cse3 .cse7 .cse8 .cse11) (and .cse0 .cse9 .cse10 .cse6 .cse2 .cse11) (and .cse0 .cse9 .cse10 .cse6 .cse2 .cse5) (and .cse9 .cse1 .cse7 .cse4 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse8 .cse5) (and .cse9 .cse10 .cse1 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse10 .cse1 .cse3 .cse7 .cse8 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse8 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse10 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse11) (and .cse9 .cse10 .cse6 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse5) (and .cse9 .cse6 .cse7 .cse4 .cse8 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse8 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse11) (and .cse9 .cse10 .cse1 .cse2 .cse7 .cse11) (and .cse10 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse9 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse9 .cse10 .cse1 .cse8 .cse5) (and .cse10 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11) (and .cse9 .cse6 .cse2 .cse7 .cse4 .cse11) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse11) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse5))) [2022-04-07 01:01:40,927 INFO L878 garLoopResultBuilder]: At program point L136-1(lines 38 146) the Hoare annotation is: (or (= main_~p9~0 0) (= main_~lk9~0 1)) [2022-04-07 01:01:40,928 INFO L878 garLoopResultBuilder]: At program point L95-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse1 (= main_~lk8~0 1)) (.cse14 (= main_~p6~0 0)) (.cse13 (= main_~lk5~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk9~0 1)) (.cse8 (= main_~p3~0 0)) (.cse9 (= main_~lk7~0 1)) (.cse10 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse15 (= main_~p9~0 0)) (.cse17 (= main_~lk3~0 1)) (.cse12 (= main_~p1~0 0)) (.cse4 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1)) (.cse16 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse5 .cse14) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse14 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse6 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse14 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse5 .cse14 .cse8) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse5 .cse7) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse5 .cse14) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse7 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse6 .cse7 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse7 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse7 .cse16) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse5 .cse6 .cse7) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse7 .cse8 .cse16) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse17 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse7 .cse16) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse5 .cse7 .cse8) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse14 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse5 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse14 .cse8) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse6 .cse7 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse11 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse11 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse14 .cse8 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse12 .cse5 .cse14 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse5 .cse14 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse5 .cse7) (and .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse13 .cse11 .cse15 .cse2 .cse12 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse14 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse5 .cse14) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse6 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse1 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse5 .cse14) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse5 .cse14 .cse8) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse14 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse7 .cse16) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse6 .cse14 .cse8 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse7 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse5 .cse7) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse1 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse7 .cse8 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse5 .cse7) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse0 .cse11 .cse2 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse15 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse5 .cse7 .cse8) (and .cse10 .cse13 .cse11 .cse15 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse5 .cse14) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse5 .cse14) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse17 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse7 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse17 .cse6 .cse14 .cse16) (and .cse9 .cse0 .cse11 .cse2 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse5 .cse7) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse14) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse17 .cse12 .cse5 .cse7) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse14 .cse8 .cse16) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8) (and .cse10 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse11 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse7 .cse16) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse5 .cse6 .cse14) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse17 .cse12 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse5 .cse7 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse17 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse5 .cse14) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse5 .cse14) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse5 .cse14 .cse8) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse7 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse1 .cse15 .cse17 .cse3 .cse4 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse1 .cse15 .cse12 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse11 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse17 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse17 .cse5 .cse7) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse14 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse11 .cse2 .cse17 .cse12 .cse4 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse11 .cse2 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse14 .cse16) (and .cse11 .cse15 .cse2 .cse12 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse5 .cse7) (and .cse9 .cse1 .cse15 .cse2 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse0 .cse11 .cse15 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse4 .cse14 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse3 .cse5 .cse14) (and .cse13 .cse11 .cse2 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse17 .cse4 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse1 .cse15 .cse2 .cse17 .cse4 .cse7 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse15 .cse14 .cse8 .cse16) (and .cse10 .cse11 .cse12 .cse3 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse17 .cse5 .cse6 .cse14) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse15 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse9 .cse0 .cse1 .cse2 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse12 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse5 .cse7) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse3 .cse5 .cse14) (and .cse10 .cse1 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse4 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse7 .cse16) (and .cse10 .cse13 .cse11 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse1 .cse2 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse14) (and .cse9 .cse10 .cse11 .cse15 .cse12 .cse4 .cse5 .cse14 .cse8) (and .cse9 .cse13 .cse11 .cse2 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse13 .cse1 .cse2 .cse17 .cse12 .cse6 .cse7 .cse16) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse10 .cse13 .cse11 .cse17 .cse12 .cse5 .cse6 .cse7) (and .cse10 .cse13 .cse1 .cse15 .cse17 .cse12 .cse3 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse17 .cse3 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse5 .cse7) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse5 .cse6 .cse14 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse11 .cse15 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse1 .cse15 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse11 .cse15 .cse2 .cse12 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse5 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse17 .cse4 .cse14 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse6 .cse14 .cse8 .cse16) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse15 .cse2 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse3 .cse5 .cse14 .cse8) (and .cse9 .cse1 .cse15 .cse2 .cse12 .cse4 .cse5 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14) (and .cse13 .cse0 .cse11 .cse15 .cse2 .cse3 .cse7 .cse8 .cse16) (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse11 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse0 .cse11 .cse15 .cse17 .cse4 .cse5 .cse14) (and .cse10 .cse13 .cse11 .cse17 .cse12 .cse3 .cse6 .cse7 .cse16) (and .cse10 .cse1 .cse17 .cse12 .cse3 .cse4 .cse6 .cse7 .cse16) (and .cse13 .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse10 .cse13 .cse0 .cse1 .cse15 .cse5 .cse14 .cse8) (and .cse10 .cse0 .cse11 .cse17 .cse3 .cse4 .cse6 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse3 .cse6 .cse14 .cse8 .cse16) (and .cse10 .cse1 .cse15 .cse12 .cse3 .cse4 .cse14 .cse8 .cse16) (and .cse10 .cse13 .cse1 .cse15 .cse12 .cse3 .cse5 .cse7 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse1 .cse12 .cse3 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse1 .cse12 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse16) (and .cse9 .cse13 .cse0 .cse1 .cse15 .cse2 .cse17 .cse7 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse15 .cse17 .cse3 .cse14 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse12 .cse3 .cse4 .cse7 .cse8 .cse16) (and .cse10 .cse0 .cse11 .cse15 .cse17 .cse3 .cse4 .cse14 .cse16) (and .cse10 .cse13 .cse0 .cse1 .cse17 .cse3 .cse6 .cse14 .cse16) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse10 .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8) (and .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse3 .cse5 .cse7) (and .cse9 .cse13 .cse0 .cse11 .cse15 .cse2 .cse17 .cse5 .cse14) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse15 .cse2 .cse12 .cse3 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse13 .cse0 .cse11 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse11 .cse15 .cse2 .cse12 .cse4 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse0 .cse1 .cse15 .cse17 .cse4 .cse14 .cse16) (and .cse13 .cse11 .cse2 .cse17 .cse12 .cse3 .cse5 .cse6 .cse14) (and .cse9 .cse13 .cse1 .cse15 .cse2 .cse17 .cse12 .cse5 .cse14) (and .cse9 .cse11 .cse15 .cse2 .cse17 .cse12 .cse4 .cse5 .cse14) (and .cse9 .cse10 .cse0 .cse11 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse10 .cse1 .cse12 .cse4 .cse5 .cse6 .cse14 .cse8) (and .cse9 .cse0 .cse11 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16) (and .cse10 .cse11 .cse15 .cse17 .cse12 .cse3 .cse4 .cse5 .cse7) (and .cse9 .cse1 .cse2 .cse12 .cse4 .cse6 .cse14 .cse8 .cse16) (and .cse9 .cse13 .cse0 .cse11 .cse2 .cse6 .cse7 .cse8 .cse16) (and .cse9 .cse10 .cse11 .cse15 .cse17 .cse12 .cse4 .cse7 .cse16))) [2022-04-07 01:01:40,929 INFO L878 garLoopResultBuilder]: At program point L87-1(lines 38 146) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-07 01:01:40,929 INFO L878 garLoopResultBuilder]: At program point L112(line 112) the Hoare annotation is: (let ((.cse13 (= main_~p9~0 0)) (.cse12 (= main_~p8~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse9 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse10 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~lk9~0 1)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse10 .cse2 .cse8 .cse3 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse12 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse13 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7) (and .cse0 .cse2 .cse13 .cse8 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse10 .cse2 .cse13 .cse8 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse12 .cse13 .cse8 .cse3 .cse4 .cse7) (and .cse0 .cse10 .cse12 .cse13 .cse8 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse8 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse2 .cse13 .cse3 .cse4 .cse7) (and .cse0 .cse12 .cse13 .cse8 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse10 .cse12 .cse8 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse8 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse8 .cse3 .cse7) (and .cse0 .cse1 .cse10 .cse12 .cse13 .cse3 .cse4 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse13 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse2 .cse13 .cse8 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse13 .cse3 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse13 .cse3 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse13 .cse3 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse3 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse13 .cse3 .cse5 .cse7) (and .cse0 .cse9 .cse10 .cse12 .cse8 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse12 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse10 .cse2 .cse8 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse13 .cse8 .cse3 .cse11) (and .cse0 .cse2 .cse13 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse2 .cse13 .cse8 .cse3 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse12 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse13 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse2 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse12 .cse13 .cse8 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse10 .cse12 .cse13 .cse8 .cse3 .cse7) (and .cse0 .cse9 .cse12 .cse8 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse2 .cse8 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse13 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse2 .cse8 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse10 .cse12 .cse8 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse9 .cse12 .cse13 .cse8 .cse3 .cse5 .cse7) (and .cse0 .cse10 .cse2 .cse13 .cse8 .cse3 .cse4 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse10 .cse12 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse12 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse8 .cse3 .cse11) (and .cse0 .cse12 .cse13 .cse8 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse13 .cse3 .cse7) (and .cse0 .cse12 .cse8 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse9 .cse1 .cse10 .cse2 .cse3 .cse6 .cse7))) [2022-04-07 01:01:40,930 INFO L878 garLoopResultBuilder]: At program point L79-1(lines 38 146) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-07 01:01:40,930 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 151) the Hoare annotation is: true [2022-04-07 01:01:40,930 INFO L878 garLoopResultBuilder]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 (not (= main_~p8~0 0))) (.cse1 (= main_~lk8~0 1))) (or (and .cse0 .cse1 (= main_~lk9~0 1)) (and .cse0 .cse1 (= main_~p9~0 0)))) [2022-04-07 01:01:40,930 INFO L878 garLoopResultBuilder]: At program point L71-1(lines 38 146) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-07 01:01:40,930 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) the Hoare annotation is: false [2022-04-07 01:01:40,930 INFO L885 garLoopResultBuilder]: At program point L63(lines 63 65) the Hoare annotation is: true [2022-04-07 01:01:40,930 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 151) the Hoare annotation is: true [2022-04-07 01:01:40,930 INFO L878 garLoopResultBuilder]: At program point L63-2(lines 38 146) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-07 01:01:40,930 INFO L878 garLoopResultBuilder]: At program point L121-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk9~0 1)) (.cse3 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse4 (= main_~p9~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse6) (and .cse1 .cse5 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse4 .cse3) (and .cse0 .cse7 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse7 .cse4 .cse5 .cse3) (and .cse0 .cse7 .cse2 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse7 .cse5 .cse2 .cse6) (and .cse0 .cse1 .cse4 .cse6) (and .cse7 .cse5 .cse2 .cse3) (and .cse0 .cse7 .cse4 .cse6))) [2022-04-07 01:01:40,931 INFO L878 garLoopResultBuilder]: At program point L122(line 122) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~lk8~0 1)) (.cse4 (= main_~lk9~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p9~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse2 .cse6 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse9))) [2022-04-07 01:01:40,931 INFO L885 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-04-07 01:01:40,931 INFO L878 garLoopResultBuilder]: At program point L106-1(lines 38 146) the Hoare annotation is: (let ((.cse10 (= main_~p3~0 0)) (.cse12 (= main_~lk5~0 1)) (.cse7 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse5 (= main_~lk9~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~lk8~0 1)) (.cse13 (= main_~p9~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~p5~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse8 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse12 .cse11 .cse3 .cse5 .cse9 .cse10) (and .cse11 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse8 .cse2 .cse5 .cse6) (and .cse11 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse11 .cse4 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse3 .cse6 .cse10) (and .cse7 .cse12 .cse1 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse1 .cse5 .cse6 .cse10) (and .cse11 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse11 .cse8 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse6 .cse10) (and .cse7 .cse1 .cse8 .cse2 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse8 .cse2 .cse5 .cse9) (and .cse12 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse1 .cse8 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse1 .cse8 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse11 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse2 .cse5 .cse6) (and .cse12 .cse1 .cse13 .cse8 .cse3 .cse6 .cse10) (and .cse12 .cse11 .cse13 .cse8 .cse3 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse3 .cse9 .cse10) (and .cse1 .cse13 .cse8 .cse3 .cse4 .cse9 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse2 .cse9) (and .cse7 .cse12 .cse11 .cse8 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse4 .cse6 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse2 .cse9) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse6 .cse10) (and .cse7 .cse1 .cse13 .cse8 .cse2 .cse4 .cse9) (and .cse7 .cse12 .cse11 .cse8 .cse5 .cse9 .cse10) (and .cse12 .cse11 .cse8 .cse3 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10) (and .cse11 .cse13 .cse8 .cse3 .cse4 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse11 .cse13 .cse8 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse2 .cse6) (and .cse7 .cse12 .cse1 .cse8 .cse5 .cse6 .cse10) (and .cse0 .cse11 .cse13 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse11 .cse8 .cse2 .cse4 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse11 .cse2 .cse5 .cse9) (and .cse0 .cse12 .cse1 .cse13 .cse3 .cse9 .cse10) (and .cse7 .cse1 .cse13 .cse8 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse12 .cse11 .cse13 .cse2 .cse3 .cse9) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse12 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse6 .cse10) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse6 .cse10) (and .cse11 .cse13 .cse8 .cse2 .cse3 .cse4 .cse9) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse2 .cse9) (and .cse0 .cse11 .cse13 .cse3 .cse4 .cse9 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse6 .cse10) (and .cse12 .cse11 .cse13 .cse8 .cse2 .cse3 .cse6) (and .cse0 .cse12 .cse11 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse1 .cse13 .cse2 .cse4 .cse6) (and .cse7 .cse12 .cse11 .cse8 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse12 .cse11 .cse13 .cse8 .cse2 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse5 .cse9 .cse10) (and .cse1 .cse13 .cse8 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse2 .cse4 .cse5 .cse9) (and .cse1 .cse13 .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse12 .cse1 .cse8 .cse2 .cse5 .cse9) (and .cse7 .cse0 .cse12 .cse11 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse1 .cse13 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse2 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 .cse11 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse1 .cse13 .cse8 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse13 .cse4 .cse9 .cse10) (and .cse7 .cse0 .cse12 .cse11 .cse13 .cse9 .cse10) (and .cse7 .cse0 .cse11 .cse13 .cse2 .cse4 .cse9) (and .cse12 .cse11 .cse13 .cse8 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse7 .cse11 .cse13 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse2 .cse6) (and .cse7 .cse0 .cse12 .cse1 .cse13 .cse2 .cse9) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse3 .cse5 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse11 .cse13 .cse8 .cse4 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse12 .cse1 .cse13 .cse8 .cse3 .cse9 .cse10) (and .cse7 .cse11 .cse13 .cse8 .cse2 .cse4 .cse9) (and .cse7 .cse1 .cse13 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse12 .cse1 .cse2 .cse5 .cse9) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse9 .cse10) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse12 .cse1 .cse8 .cse2 .cse3 .cse5 .cse9) (and .cse12 .cse11 .cse13 .cse8 .cse2 .cse3 .cse9) (and .cse7 .cse0 .cse11 .cse13 .cse4 .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse10) (and .cse12 .cse11 .cse8 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse7 .cse12 .cse1 .cse13 .cse8 .cse9 .cse10) (and .cse0 .cse12 .cse11 .cse3 .cse5 .cse6 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse11 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse1 .cse13 .cse8 .cse2 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse9) (and .cse12 .cse11 .cse8 .cse2 .cse3 .cse5 .cse9) (and .cse7 .cse0 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse8 .cse2 .cse3 .cse4 .cse9))) [2022-04-07 01:01:40,931 INFO L885 garLoopResultBuilder]: At program point L40(lines 40 42) the Hoare annotation is: true [2022-04-07 01:01:40,932 INFO L878 garLoopResultBuilder]: At program point L131-1(lines 38 146) the Hoare annotation is: (let ((.cse1 (= main_~p9~0 0)) (.cse2 (= main_~p8~0 0)) (.cse0 (= main_~lk8~0 1)) (.cse3 (= main_~lk9~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse0 .cse3))) [2022-04-07 01:01:40,932 INFO L878 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse8 (= main_~lk8~0 1)) (.cse14 (= main_~lk9~0 1)) (.cse10 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse12 (= main_~p5~0 0)) (.cse13 (= main_~p3~0 0)) (.cse11 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse12 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse4 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse14 .cse10 .cse7) (and .cse2 .cse4 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse2 .cse4 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse14 .cse10 .cse7) (and .cse2 .cse4 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse12 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse12 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse14 .cse10 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse11 .cse2 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse12 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse10 .cse7) (and .cse0 .cse2 .cse4 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse12 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse12 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse12 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse12 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse12 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse12 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse12 .cse6 .cse7) (and .cse11 .cse1 .cse2 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse12 .cse14 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse12 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse14 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7))) [2022-04-07 01:01:40,932 INFO L878 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse3 (= main_~lk9~0 1)) (.cse4 (= main_~lk8~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~p9~0 0)) (.cse2 (not (= main_~p7~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2) (and .cse0 .cse1 .cse5 .cse2))) [2022-04-07 01:01:40,933 INFO L878 garLoopResultBuilder]: At program point L91-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-04-07 01:01:40,933 INFO L878 garLoopResultBuilder]: At program point L116-1(lines 38 146) the Hoare annotation is: (let ((.cse5 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse8 (= main_~lk9~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~p6~0 0)) (.cse6 (= main_~lk8~0 1)) (.cse2 (= main_~p9~0 0)) (.cse3 (= main_~p7~0 0)) (.cse7 (= main_~p5~0 0)) (.cse9 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse5 .cse0 .cse1 .cse8 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse6 .cse3 .cse8 .cse4) (and .cse5 .cse1 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse5 .cse0 .cse6 .cse8 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse5 .cse1 .cse2 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse9) (and .cse5 .cse1 .cse2 .cse7 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse6 .cse2 .cse3 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse4) (and .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse3 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse3 .cse7 .cse9))) [2022-04-07 01:01:40,934 INFO L878 garLoopResultBuilder]: At program point L83-1(lines 38 146) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-07 01:01:40,934 INFO L885 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-04-07 01:01:40,934 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 38 146) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-07 01:01:40,934 INFO L878 garLoopResultBuilder]: At program point L67-1(lines 38 146) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-07 01:01:40,934 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (let ((.cse9 (= main_~lk8~0 1)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~p7~0 0)) (.cse8 (= main_~lk9~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse4 (not (= main_~p4~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse11 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse6) (and .cse1 .cse9 .cse4 .cse5 .cse7 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse6) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse6) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse9 .cse4 .cse5 .cse7 .cse10 .cse8 .cse11) (and .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse10 .cse8 .cse11) (and .cse2 .cse4 .cse5 .cse7 .cse10 .cse8 .cse6) (and .cse1 .cse9 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse9 .cse4 .cse5 .cse7 .cse10 .cse8 .cse6) (and .cse0 .cse9 .cse4 .cse5 .cse10 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse9 .cse4 .cse5 .cse10 .cse8 .cse6) (and .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse6) (and .cse2 .cse4 .cse5 .cse7 .cse10 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse10 .cse8 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11))) [2022-04-07 01:01:40,934 INFO L878 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (= main_~lk9~0 1) [2022-04-07 01:01:40,934 INFO L878 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-04-07 01:01:40,935 INFO L878 garLoopResultBuilder]: At program point L101-1(lines 38 146) the Hoare annotation is: (let ((.cse4 (= main_~lk4~0 1)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p9~0 0)) (.cse9 (= main_~p7~0 0)) (.cse6 (= main_~p6~0 0)) (.cse7 (= main_~lk2~0 1)) (.cse13 (= main_~p3~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse11 (= main_~p4~0 0)) (.cse8 (= main_~lk8~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse14 (= main_~p5~0 0)) (.cse12 (= main_~p2~0 0)) (.cse15 (= main_~lk9~0 1)) (.cse10 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse6 .cse13) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse4 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse15 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse12 .cse10) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse2 .cse4 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse8 .cse4 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse10 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse15 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse2 .cse4 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse15 .cse10 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse12 .cse15 .cse10) (and .cse11 .cse2 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse12 .cse10 .cse13) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse1 .cse8 .cse4 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse15 .cse6) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse10 .cse13) (and .cse11 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse12 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse12 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse12 .cse6 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse11 .cse2 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse10 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse11 .cse8 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse8 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse12 .cse10 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse4 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse12 .cse10 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse10 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse1 .cse8 .cse3 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse8 .cse4 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse6 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse6) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse8 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13) (and .cse11 .cse1 .cse8 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse12 .cse6) (and .cse2 .cse3 .cse4 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse15 .cse10 .cse7) (and .cse11 .cse2 .cse9 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse10 .cse7) (and .cse0 .cse2 .cse4 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse1 .cse2 .cse4 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse8 .cse4 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse13 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse9 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse15 .cse10 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse15 .cse6 .cse13 .cse7) (and .cse11 .cse8 .cse3 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse1 .cse2 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse0 .cse8 .cse4 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse8 .cse3 .cse4 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse15 .cse10) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse5 .cse9 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse6 .cse7) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse12 .cse6) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse12 .cse15 .cse6) (and .cse2 .cse4 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse12 .cse10) (and .cse0 .cse8 .cse3 .cse4 .cse14 .cse10 .cse13 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse8 .cse3 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse4 .cse5 .cse9 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse8 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse2 .cse3 .cse14 .cse12 .cse6 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse6 .cse13 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse12 .cse10) (and .cse0 .cse8 .cse4 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse12 .cse6 .cse13) (and .cse0 .cse11 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse2 .cse3 .cse4 .cse9 .cse14 .cse6 .cse13 .cse7) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse14 .cse15 .cse6 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse2 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse2 .cse5 .cse9 .cse14 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse2 .cse3 .cse5 .cse14 .cse12 .cse10) (and .cse0 .cse11 .cse1 .cse8 .cse3 .cse5 .cse12 .cse10) (and .cse2 .cse4 .cse9 .cse14 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse14 .cse12 .cse10 .cse13) (and .cse11 .cse8 .cse3 .cse5 .cse9 .cse14 .cse6 .cse7) (and .cse11 .cse1 .cse8 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse0 .cse11 .cse8 .cse3 .cse14 .cse12 .cse6 .cse13) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse14 .cse12 .cse6) (and .cse11 .cse1 .cse2 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse11 .cse1 .cse2 .cse9 .cse15 .cse6 .cse13 .cse7) (and .cse8 .cse4 .cse9 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse12 .cse15 .cse6) (and .cse0 .cse11 .cse2 .cse14 .cse12 .cse15 .cse10 .cse13) (and .cse11 .cse1 .cse8 .cse3 .cse5 .cse9 .cse12 .cse6) (and .cse0 .cse11 .cse2 .cse5 .cse14 .cse15 .cse10 .cse7) (and .cse11 .cse8 .cse9 .cse14 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse11 .cse1 .cse2 .cse15 .cse10 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse15 .cse10 .cse13 .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse14 .cse6 .cse13 .cse7) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse15 .cse6 .cse13) (and .cse1 .cse8 .cse4 .cse5 .cse9 .cse12 .cse15 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse11 .cse1 .cse8 .cse12 .cse15 .cse10 .cse13) (and .cse0 .cse11 .cse1 .cse8 .cse5 .cse12 .cse15 .cse10) (and .cse0 .cse11 .cse8 .cse5 .cse14 .cse12 .cse15 .cse10))) [2022-04-07 01:01:40,938 INFO L719 BasicCegarLoop]: Path program 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] [2022-04-07 01:01:40,940 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 01:01:40,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 01:01:40 BoogieIcfgContainer [2022-04-07 01:01:40,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 01:01:40,949 INFO L158 Benchmark]: Toolchain (without parser) took 496198.65ms. Allocated memory was 184.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 134.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-04-07 01:01:40,949 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory was 150.5MB in the beginning and 150.4MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 01:01:40,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.08ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 159.8MB in the end (delta: -25.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 01:01:40,949 INFO L158 Benchmark]: Boogie Preprocessor took 27.23ms. Allocated memory is still 184.5MB. Free memory was 159.8MB in the beginning and 158.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 01:01:40,949 INFO L158 Benchmark]: RCFGBuilder took 409.48ms. Allocated memory is still 184.5MB. Free memory was 158.2MB in the beginning and 145.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 01:01:40,950 INFO L158 Benchmark]: TraceAbstraction took 495532.38ms. Allocated memory was 184.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 145.4MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-04-07 01:01:40,950 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory was 150.5MB in the beginning and 150.4MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.08ms. Allocated memory is still 184.5MB. Free memory was 134.0MB in the beginning and 159.8MB in the end (delta: -25.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.23ms. Allocated memory is still 184.5MB. Free memory was 159.8MB in the beginning and 158.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 409.48ms. Allocated memory is still 184.5MB. Free memory was 158.2MB in the beginning and 145.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 495532.38ms. Allocated memory was 184.5MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 145.4MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 495.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 481.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2859 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2859 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 1968 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=24, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 12851 NumberOfFragments, 51244 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 269.1s HoareSimplificationTime, 42 FomulaSimplificationsInter, 2169939 FormulaSimplificationTreeSizeReductionInter, 212.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 01:01:40,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...